Komeniusz dev-blog

/*
 *     This is the C++ implementation of the MD5 Message-Digest
 *     Algorithm desrcipted in RFC 1321.
 *     I translated the C code from this RFC to C++.
 *     There is no warranty.
 *
 *     Feb. 12. 2005
 *     Benjamin Grüdelbach
 */
 
/*
 *    Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
 *    rights reserved.
 *
 *    License to copy and use this software is granted provided that it
 *    is identified as the "RSA Data Security, Inc. MD5 Message-Digest
 *    Algorithm" in all material mentioning or referencing this software
 *    or this function.
 *
 *    License is also granted to make and use derivative works provided
 *    that such works are identified as "derived from the RSA Data
 *    Security, Inc. MD5 Message-Digest Algorithm" in all material
 *    mentioning or referencing the derived work.
 *
 *    RSA Data Security, Inc. makes no representations concerning either
 *    the merchantability of this software or the suitability of this
 *    software for any particular purpose. It is provided "as is"
 *    without express or implied warranty of any kind.
 *
 *    These notices must be retained in any copies of any part of this
 *    documentation and/or software.
 */
 
//md5 class include
#include "md5.h"
 
// Constants for MD5Transform routine.
#define S11 7
#define S12 12
#define S13 17
#define S14 22
#define S21 5
#define S22 9
#define S23 14
#define S24 20
#define S31 4
#define S32 11
#define S33 16
#define S34 23
#define S41 6
#define S42 10
#define S43 15
#define S44 21
 
static unsigned char PADDING[64] = {
  0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
 
/* F, G, H and I are basic MD5 functions. */
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
#define H(x, y, z) ((x) ^ (y) ^ (z))
#define I(x, y, z) ((y) ^ ((x) | (~z)))
 
/* ROTATE_LEFT rotates x left n bits. */
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
//#define ROTATE_LEFT(x, n) (((x) << (n)) | (( (UINT32) x) >> (32-(n))))
 
/*
FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
Rotation is separate from addition to prevent recomputation.
*/
#define FF(a, b, c, d, x, s, ac) { 
 (a) += F ((b), (c), (d)) + (x) + (unsigned long int)(ac); 
 (a) = ROTATE_LEFT ((a), (s)); 
 (a) += (b); 
  }
 
#define GG(a, b, c, d, x, s, ac) { 
 (a) += G ((b), (c), (d)) + (x) + (unsigned long int)(ac); 
 (a) = ROTATE_LEFT ((a), (s)); 
 (a) += (b); 
  }
#define HH(a, b, c, d, x, s, ac) { 
 (a) += H ((b), (c), (d)) + (x) + (unsigned long int)(ac); 
 (a) = ROTATE_LEFT ((a), (s)); 
 (a) += (b); 
  }
#define II(a, b, c, d, x, s, ac) { 
 (a) += I ((b), (c), (d)) + (x) + (unsigned long int)(ac); 
 (a) = ROTATE_LEFT ((a), (s)); 
 (a) += (b); 
  }
 
/* MD5 initialization. Begins an MD5 operation, writing a new context. */
void MD5::MD5Init (MD5_CTX *context)
{
      context->count[0] = context->count[1] = 0;
      context->state[0] = 0x67452301;
      context->state[1] = 0xefcdab89;
      context->state[2] = 0x98badcfe;
      context->state[3] = 0x10325476;
}
 
/*
    MD5 block update operation. Continues an MD5 message-digest
    operation, processing another message block, and updating the
    context.
*/
void MD5::MD5Update (MD5_CTX *context, unsigned char *input, unsigned int inputLen)
{
      unsigned int i, index, partLen;
 
      /* Compute number of bytes mod 64 */
      index = (unsigned int)((context->count[0] >> 3) & 0x3F);
 
      /* Update number of bits */
      if ( (context->count[0] += ((unsigned long int)inputLen << 3))
           < ((unsigned long int)inputLen << 3))
        context->count[1]++;
 
      context->count[1] += ((unsigned long int)inputLen >> 29);
      partLen = 64 - index;
 
      /*
       * Transform as many times as possible.
       */
      if (inputLen >= partLen)
      {
        MD5_memcpy ((POINTER)&context->buffer[index], (POINTER)input, partLen);
        MD5Transform (context->state, context->buffer);
 
        for (i = partLen; i + 63 < inputLen; i += 64)
           MD5Transform (context->state, &input[i]);
 
        index = 0;
      }
      else
        i = 0;
 
      /* Buffer remaining input */
      MD5_memcpy ((POINTER)&context->buffer[index],
                  (POINTER)&input[i],
              inputLen-i);
}
 
/*
 * MD5 finalization. Ends an MD5 message-digest operation, writing the
 * the message digest and zeroizing the context.
 */
void MD5::MD5Final (unsigned char digest[16], MD5_CTX *context)
{
    unsigned char bits[8];
    unsigned int index, padLen;
 
    /* Save number of bits */
    Encode (bits, context->count, 8);
 
    /*
    * Pad out to 56 mod 64.
    */
    index = (unsigned int)((context->count[0] >> 3) & 0x3f);
    padLen = (index < 56) ? (56 - index) : (120 - index);
    MD5Update (context, PADDING, padLen);
 
    /* Append length (before padding) */
    MD5Update (context, bits, 8);
 
    /* Store state in digest */
    Encode (digest, context->state, 16);
 
    /*
    * Zeroize sensitive information.
    */
    MD5_memset ((POINTER)context, 0, sizeof (*context));
}
 
/*
 * MD5 basic transformation. Transforms state based on block.
 */
void MD5::MD5Transform (unsigned long int state[4], unsigned char block[64])
{
    unsigned long int a = state[0], b = state[1], c = state[2], d = state[3], x[16];
 
    Decode (x, block, 64);
 
    /* Round 1 */
    FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
    FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
    FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
    FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
    FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
    FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
    FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
    FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
    FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
    FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
    FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
    FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
    FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
    FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
    FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
    FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
 
    /* Round 2 */
    GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
    GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
    GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
    GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
    GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
    GG (d, a, b, c, x[10], S22,  0x2441453); /* 22 */
    GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
    GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
    GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
    GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
    GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
 
    GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
    GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
    GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
    GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
    GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
 
    /* Round 3 */
    HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
    HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
    HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
    HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
    HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
    HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
    HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
    HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
    HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
    HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
    HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
    HH (b, c, d, a, x[ 6], S34,  0x4881d05); /* 44 */
    HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
    HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
    HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
    HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
 
    /* Round 4 */
    II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
    II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
    II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
    II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
    II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
    II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
    II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
    II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
    II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
    II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
    II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
    II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
    II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
    II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
    II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
    II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
 
    state[0] += a;
    state[1] += b;
    state[2] += c;
    state[3] += d;
 
    /*
    * Zeroize sensitive information.
    */
    MD5_memset ((POINTER)x, 0, sizeof (x));
}
 
/*
 * Encodes input (unsigned long int) into output (unsigned char). Assumes len is
 * a multiple of 4.
 */
void MD5::Encode (unsigned char *output, unsigned long int *input, unsigned int len)
{
    unsigned int i, j;
 
    for (i = 0, j = 0; j < len; i++, j += 4) {
        output[j] = (unsigned char)(input[i] & 0xff);
        output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
        output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
        output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
    }
}
 
/*
 * Decodes input (unsigned char) into output (unsigned long int). Assumes len is
 * a multiple of 4.
 */
void MD5::Decode (unsigned long int *output, unsigned char *input, unsigned int len)
{
      unsigned int i, j;
 
      for (i = 0, j = 0; j < len; i++, j += 4)
        output[i] = ((unsigned long int)input[j]) |
                 (((unsigned long int)input[j+1]) << 8) |
                 (((unsigned long int)input[j+2]) << 16) |
                 (((unsigned long int)input[j+3]) << 24);
}
 
/*
 * Note: Replace "for loop" with standard memcpy if possible.
 */
void MD5::MD5_memcpy (POINTER output, POINTER input, unsigned int len)
{
    unsigned int i;
 
    for (i = 0; i < len; i++)
        output[i] = input[i];
}
 
/*
 * Note: Replace "for loop" with standard memset if possible.
 */
void MD5::MD5_memset (POINTER output,int value,unsigned int len)
{
    unsigned int i;
    for (i = 0; i < len; i++)
        ((char *)output)[i] = (char)value;
}
 
/*
 * EOF
 */

/*
 *	This is the C++ implementation of the MD5 Message-Digest
 *	Algorithm desrcipted in RFC 1321.
 *	I translated the C code from this RFC to C++.
 *	There is no warranty.
 *
 *	Feb. 12. 2005
 *	Benjamin Grüdelbach
 */
 
/*
 * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
 * rights reserved.
 *
 * License to copy and use this software is granted provided that it
 * is identified as the "RSA Data Security, Inc. MD5 Message-Digest
 * Algorithm" in all material mentioning or referencing this software
 * or this function.
 *
 * License is also granted to make and use derivative works provided
 * that such works are identified as "derived from the RSA Data
 * Security, Inc. MD5 Message-Digest Algorithm" in all material
 * mentioning or referencing the derived work.
 *
 * RSA Data Security, Inc. makes no representations concerning either
 * the merchantability of this software or the suitability of this
 * software for any particular purpose. It is provided "as is"
 * without express or implied warranty of any kind.
 *
 * These notices must be retained in any copies of any part of this
 * documentation and/or software.
 */
 
//----------------------------------------------------------------------
//include protection
#ifndef MD5_H
#define MD5_H
 
//----------------------------------------------------------------------
//STL includes
#include <string>
 
//----------------------------------------------------------------------
//typedefs
typedef unsigned char *POINTER;
 
/*
 * MD5 context.
 */
typedef struct
{
	unsigned long int state[4];   	      /* state (ABCD) */
	unsigned long int count[2]; 	      /* number of bits, modulo 2^64 (lsb first) */
	unsigned char buffer[64];	      /* input buffer */
} MD5_CTX;
 
/*
 * MD5 class
 */
class MD5
{
 
	private:
 
		void MD5Transform (unsigned long int state[4], unsigned char block[64]);
		void Encode (unsigned char*, unsigned long int*, unsigned int);
		void Decode (unsigned long int*, unsigned char*, unsigned int);
		void MD5_memcpy (POINTER, POINTER, unsigned int);
		void MD5_memset (POINTER, int, unsigned int);
 
	public:
 
		void MD5Init (MD5_CTX*);
		void MD5Update (MD5_CTX*, unsigned char*, unsigned int);
		void MD5Final (unsigned char [16], MD5_CTX*);
 
	MD5(){};
};
 
//----------------------------------------------------------------------
//End of include protection
#endif
 
/*
 * EOF
 */

/*
 *	This is part of my wrapper-class to create
 *	a MD5 Hash from a string and a file.
 *
 *	This code is completly free, you
 *	can copy it, modify it, or do
 *	what ever you want with it.
 *
 *	Feb. 2005
 *	Benjamin Grüdelbach
 */
 
//----------------------------------------------------------------------
//basic includes
#include <fstream>
#include <iostream>
 
//my includes
#include "md5wrapper.h"
#include "md5.h"
 
//---------privates--------------------------
 
/*
 * internal hash function, calling
 * the basic methods from md5.h
 */
std::string md5wrapper::hashit(std::string text)
{
	MD5_CTX ctx;
 
	//init md5
	md5->MD5Init(&ctx);
	//update with our string
	md5->MD5Update(&ctx,
		 (unsigned char*)text.c_str(),
		 text.length());
 
	//create the hash
	unsigned char buff[16] = "";
	md5->MD5Final((unsigned char*)buff,&ctx);
 
	//converte the hash to a string and return it
	return convToString(buff);
}
 
/*
 * converts the numeric hash to
 * a valid std::string.
 * (based on Jim Howard's code;
 * http://www.codeproject.com/cpp/cmd5.asp)
 */
std::string md5wrapper::convToString(unsigned char *bytes)
{
	char asciihash[33];
 
	int p = 0;
	for(int i=0; i<16; i++)
	{
		::sprintf(&asciihash[p],"%02x",bytes[i]);
		p += 2;
	}
	asciihash[32] = '';
	return std::string(asciihash);
}
 
//---------publics--------------------------
 
//constructor
md5wrapper::md5wrapper()
{
	md5 = new MD5();
}
 
//destructor
md5wrapper::~md5wrapper()
{
	delete md5;
}
 
/*
 * creates a MD5 hash from
 * "text" and returns it as
 * string
 */
std::string md5wrapper::getHashFromString(std::string text)
{
	return this->hashit(text);
}
 
/*
 * creates a MD5 hash from
 * a file specified in "filename" and
 * returns it as string
 * (based on Ronald L. Rivest's code
 * from RFC1321 "The MD5 Message-Digest Algorithm")
 */
std::string md5wrapper::getHashFromFile(std::string filename)
{
	FILE *file;
  	MD5_CTX context;
 
	int len;
  	unsigned char buffer[1024], digest[16];
 
	//open file
  	if ((file = fopen (filename.c_str(), "rb")) == NULL)
	{
		return "-1";
	}
 
	//init md5
 	md5->MD5Init (&context);
 
	//read the filecontent
	while ( (len = fread (buffer, 1, 1024, file)) )
   	{
		md5->MD5Update (&context, buffer, len);
	}
 
	/*
	generate hash, close the file and return the
	hash as std::string
	*/
	md5->MD5Final (digest, &context);
 	fclose (file);
	return convToString(digest);
 }
 
/*
 * EOF
 */

/*
 *	This is my wrapper-class to create
 *	a MD5 Hash from a string and a file.
 *
 *	This code is completly free, you
 *	can copy it, modify it, or do
 *	what ever you want with it.
 *
 *	Feb. 2005
 *	Benjamin Grüdelbach
 */
 
//include protection
#ifndef MD5WRAPPER_H
#define MD5WRAPPER_H
 
//basic includes
#include <string>
 
//forwards
class MD5;
 
class md5wrapper
{
	private:
		MD5 *md5;
 
		/*
		 * internal hash function, calling
		 * the basic methods from md5.h
		 */
		std::string hashit(std::string text);
 
		/*
		 * converts the numeric giets to
		 * a valid std::string
		 */
		std::string convToString(unsigned char *bytes);
	public:
		//constructor
		md5wrapper();
 
		//destructor
		~md5wrapper();
 
		/*
		 * creates a MD5 hash from
		 * "text" and returns it as
		 * string
		 */
		std::string getHashFromString(std::string text);
 
		/*
		 * creates a MD5 hash from
		 * a file specified in "filename" and
		 * returns it as string
		 */
		std::string getHashFromFile(std::string filename);
};
 
//include protection
#endif
 
/*
 * EOF
 */

/*includujemy biblioteki i inne bajery*/
#include <iostream> //dyrektywy
#include "md5wrapper.h" //kodowanie md5
using namespace std; //dla wygody
 
int main() {
	string zmienna = "haslo"; //deklaracja zmiennej wejsciowej
	string zmienna2; //deklaracja zmienne wyjsciowej
	md5wrapper md5; //deklarujemy obiekt algorytmu hashujacego
	zmienna2 = md5.getHashFromString(zmienna); //kodowanie zmiennej
	cout<<zmienna2<<endl; //drukowanie informacji zwrotnej w postacji hasha MD5
}

#include <iostream>
#include <conio.h>
#include <string>
#include <vector>
using namespace std;
 
string napis,tmp;
vector<char> strTekst;
bool b=0;
 
void funkcja (int t, string s)
{
     if(b) printf("n");
     if(!b) b=1;
     if(t==s.size()) { strTekst.pop_back(); t=0; return;  }
     for(int i=0; i<s.size(); ++i)
     {
             for(int j=0; j<strTekst.size(); ++j)
                     printf("%c",strTekst[j]);
 
             printf("%c",s[i]);
             strTekst.push_back(s[i]);
             funkcja(t+1,s);
     }
     strTekst.pop_back();
     return;
}
 
bool Sprawdz[128];
 
void powtorzenia(char znak)
{
     if(!Sprawdz[znak]) tmp.push_back(znak);
     Sprawdz[znak]=1;
}
 
int main()
{
    for(int i=0; i<128; ++i)
            Sprawdz[i]=0;
 
    cin>>napis;
    sort(napis.begin(), napis.end());
    for_each(napis.begin(), napis.end(), powtorzenia);
    napis=tmp;
    funkcja (0,napis);
 
    getch();
    return 0;
}

/*includujemy biblioteki i inne bajery*/
#include <iostream> //dyrektywy
#include "md5wrapper.h" //kodowanie md5
//generaot
#include <string>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
///generator
using namespace std; //dla wygody
/*deklaracje zmiennych*/
string hash; //wprowadzany hash
string hash2; //generowany hash
string zmienna_pomocnicza; //funkcja hashujaca nie przyjmuje jako parametr indeksu tablicy
 
/*generator permutacji z powtorzeniami*/
string alfabet,tmp;
vector<char> strTekst;
bool b=0;
int dlugosc; //maksymalna dlugosc hasla
 
void funkcja(int t, string s)
{
md5wrapper md5; //deklarujemy obiekt algorytmu hashujacego
	if(b)
	if(!b) b=1;
	if(t==dlugosc)
	{
		strTekst.pop_back(); t=0;
		return;
	}
	for(int i=0; i<s.size(); ++i)
	{
		zmienna_pomocnicza = s[i];
		for(int j=0; j<strTekst.size(); ++j)
		{
			if(zmienna_pomocnicza.size() > dlugosc) //jesli nie zlamiemy hasla
			{
				cout<<endl;
				cout<<"Brutus zakonczyl dzialanie z niepowodzeniem :("<<endl;
				exit(1);
			}
 
			cout<<strTekst[j];
			zmienna_pomocnicza += strTekst[j];
 
        }
        cout<<s[i];
 
		hash2 = md5.getHashFromString(zmienna_pomocnicza); //generujemy hash
		cout<<"   ["<<hash2<<"] ["<<hash<<"]"<<endl;
 
		if(hash == hash2) //jesli zlamalismy haslo
		{
			cout<<"Brutus zakonczyl dzialanie z powodzeniem!"<<endl;
			cout<<"Haslo to: "<<zmienna_pomocnicza<<endl;
			exit(1);
		}
		strTekst.push_back(s[i]);
		funkcja(t+1,s);
	}
	strTekst.pop_back();
	return;
}
 
bool Sprawdz[128];
 
void powtorzenia(char znak)
{
	if(!Sprawdz[znak])
	{
		tmp.push_back(znak);
		Sprawdz[znak]=1;
	}
}
/*/generator permutacji z powtorzeniami*/
 
/*kod programu*/
int main()
{
cout<<"Podaj alfabet: ";
cin>>alfabet; //pobieramy alfabet
 
cout<<"Podaj maksymalna dlugosc hasla: ";
cin>>dlugosc; //pobieramy maksymalna dlugosc hasla
 
cout<<"Podaj hash MD5: ";
cin>>hash; //pobieramy hash
if(hash.size() != 32) //jesli wprowadzono bledny hash
{
	cout<<"Hash MD5 sklada sie z 32 znakow!"<<endl;
	return 0; //konczymy dzialanie programu
}
 
while(1) //no to po pobraniu danych zaczynamy zabawe
{
	for(int i=0; i<128; ++i)
	{
		Sprawdz[i]=0;
	}
 
    sort(alfabet.begin(), alfabet.end());
    for_each(alfabet.begin(), alfabet.end(), powtorzenia);
    alfabet=tmp;
    funkcja(0,alfabet);
}
 
return 0;
} //koniec