This page has been robot translated, sorry for typos if any. Original content here.

Coding and Decoding MD5 / SHA-1 / CRC32, Brut Force, Generation of Word List Online

Кодинг и Декодинг MD5/SHA-1, CRC32 суммы, Брут форс, Генерация ворд листа

Coding information is the process of converting a signal from a form that is convenient for the direct use of information into a form that is convenient for transmission, storage, or automatic processing. This is writing code, scripts, to output a certain algorithm in a certain programming language.

Decoding is the reverse transformation (restoring the content of encoded information).

Hashing by the MD5 / SHA-1 method and the sum by the CRC32 algorithm

Кодинг и Декодинг MD5/SHA-1, CRC32 суммы, Брут форс, Генерация ворд листа

MD5 Message Digest 5 is a 128-bit hash algorithm developed by Professor Ronald L. Rivest of the Massachusetts Institute of Technology (MIT) in 1991. This algorithm is designed to replace a less reliable predecessor - MD4. It is intended for creation of "prints" or digests of the message of any length and the subsequent check of their authenticity. The hash contains 128 bits (16 bytes) and is usually represented as a sequence of 32 hexadecimal digits. Widely used to verify the integrity of information and store passwords in a closed form. After that, MD5 was used to solve a variety of tasks, from hashing passwords to CMS to creating digital signatures and SSL certificates. The algorithm was first published in April 1992 in RFC 1321. The MD5 algorithm is vulnerable to some attacks, for example, it is possible to create two messages with the same hash sum, so its use is not recommended. Alternatives are the algorithms of the SHA-2 family.

Secure Hash Algorithm 1 - algorithm of cryptographic hashing. It is described in RFC 3174. For an input message of arbitrary length ( maximum {\ displaystyle 2 ^ {64} -1} 2 ^ {64} -1 bits, which is approximately 2 exabytes ), the algorithm generates a 160-bit hash value, also called a digest message. Used in many cryptographic applications and protocols. Also recommended as the main for government agencies in the US. The principles underlying the SHA-1 are similar to those used by Ronald Reeves when designing MD4.

The checksum (CRC8, CRC16, CRC32) is some value calculated from the data set by applying a certain algorithm and used to verify the integrity of the data during transmission or storage. Also, checksums can be used to quickly compare two sets of data to nonequivalence. This can be used, for example, to detect computer viruses. In terms of mathematics, the checksum is the result of a hash function used to compute a control code-a small number of bits within a large data block, for example, a network packet or a computer file block used to detect errors in the transmission or storage of information. Cyclic redundant code ( in particular, CRC8, CRC16, CRC32 ) is used to verify the integrity of data transmission. The archiver programs include the CRC of the source data in the created archive so that the recipient can verify the correctness of the received data.



The tool allows you to get the MD5 and SHA-1 hash and calculate the checksum using the CRC32 algorithm of any string. Type in the line "Text" word that you need to code. Clicking on HESHING will get the result of encoding on the screen.

Decoding of MD5 hashes by the method of password collection (brute force)

A full search (or "brute force" method ) is a method of solving mathematical problems. Refers to a class of methods for finding solutions by exhausting all possible variants. The complexity of a complete search depends on the number of all possible solutions of the problem. If the solution space is very large, a full search can not yield results for several years or even centuries.

Any problem in the class NP can be solved by a complete listing. In this case, even if the calculation of the objective function from each specific possible solution of the problem can be carried out in polynomial time, depending on the number of all possible solutions, a complete search may require an exponential running time.

In cryptography, on the computational complexity of a complete enumeration, the evaluation of the cryptographic strength of ciphers is based. In particular, the cipher is considered crypto-resistant if there is no "hacking" method that is substantially faster than a full search of all keys. Cryptographic attacks, based on the method of full search, are the most universal, but also the longest.

Hash MD5:

Delyona words: 1 2 3 4 5 6th 7th 8 9 ? (unknown)


The tool allows to get the result of MD5 hash decoding of any complexity. In the line "Hash MD5" enter the hash to be decoded. In the "Symbols" line, enter the characters that make up the encoded word or use the current ones. In the line "Length of a word" it is necessary to choose the possible length of the searched word. Clicking on the DECODING will get the result as a file.

Generation of Word Words


Length of word: 1 2 3 4 5 6th 7th 8 9


In the "Symbols" line, enter the characters from which you want to create a Word Sheet or use the current ones. In the line "Length of a word" , specify the length of the words to be composed. Clicking on the GENERATION will get the result as a file.

!! Caution: Generating a sheet from a large set of letters takes more than 15 minutes. If you decide to do this, do not refresh the page after clicking the button! And it's better not to do this, we'll banish you forever :(

Hashes of the most frequently used passwords

Password MD5 hash
0 cfcd208495d565ef66e7dff9f98764da
000 c6f057b86584942e415435ffb1fa93d4
007 9e94b15ed312fa42232fd87a55db0d39
1 c4ca4238a0b923820dcc509a6f75849b
111 698d51a19d8a121ce581499d7b701668
123 202cb962ac59075b964b07152d234b70
123456 e10adc3949ba59abbe56e057f20f883e
123123 4297f44b13955235245b2497399d7a93
12345 827ccb0eea8a706c4c34a16891f84e7b
qwe 76d80224611fc919a5d54f0ff9fba446
qweqwe efe6398127928f1b2e9ef3207fb82663
asd 7815696ecbf1c96e6894b779456d330e
asdasd a8f5f167f44f4964e6c998dee827110c
asdf 912ec803b2ce49e4a541068d495ab570
zxc 5fa72358f0b4fb4f2c5d7de8c9a41846
zxczxc ecb97ffafc1798cd2f67fcbc37226761
zxcvb eb89f40da6a539dd1b1776e522459763
zxcvbn b427ebd39c845eb5417b7f7aaf1f9724
zxcv fd2cc6c54239c40495a0d3a93b6380eb
admin 21232f297a57a5a743894a0e4a801fc3
administrator 200ceb26807d6bf99fd6f4f0d1ca54d4
Admin e3afed0047b08059d0fada10f400c1e5
Administrator 7b7bc2512ee1fedcd76bdc68926d4f7b
gfhjkm d9d1b168eac8f197e0576b56cfc23ece
flvby 3a28525729392f0746380a44b200bb21
flvbybcnhfnjh 8b7d272b7b9177fcac0d38aa06f4ab99
gfhjkm d9d1b168eac8f197e0576b56cfc23ece
ghbdtn 2a3dfa66c2d8e8c67b77f2a25886e3cf
qwerty d8578edf8458ce06fbc5bb76a58c5ca4
test 098f6bcd4621d373cade4e832627b4f6
pass 1a1dc91c907325c69271ddf0c944bc72
vfif f86eb133aea0114a01595cac67dbcb17
lbvf 40f1b6d9156fb4c5c93c60b79667c0b7
ybrbnf 79f0c81692f7d073c7d5f713b78124eb
dfcz d9d53ccc12ebe52f20aca9077a992b09
gfif cb7347eb95885a2f1ef3036057bfe2b5
google c822c1b63853ed273b89687ac505f9fa
ueukm fee2125a43bcb6e04814160d4ea0dccd
vjcrdf 4ada42a5a7ca1ffff1632a6f812f0599
Vjcrdf 77af9af7ebfba6070e0b29d34d4d5327
, fhfrelf 464f677bc2a846d08cb5c64bc63c1dee
frekf 94b1c676abcd33c1af912cdc0bd84958
zyltrc f2e1189d0d738b2d692a76685b949e5a
gbljhfcs 1b281e2f8ae07815a00de53192d618aa
ehjls 10cab130d6d53689e0c7f60c094431f6
, kzlm 985a1978be91d7abfb7065bb15c91a61
, kby ff7087f014ceb8d7a48b5f9dff09e876
rfr ltkf 2e4dc7d9e7e84a08507443fc046adf30
lehfr b35217036f336fe4c686b52685c2d2c6
lehf 4233c3889e28db97475d062682e91f53
cbcntvf 21881c7e863d8db5770ed0904b15e624
; jgf d3f47852e1445cba95855825b789ce02
gfhjkmxbr 987cadce9ef28e63f7cdba0b66eb1371

Password selection on md5 [php] script

// Устанавливаем неограниченное время выполнения скрипта
set_time_limit ( 0 );

// Читаем пароли из файла password
$pass = file ( "password.txt" );
$pass as $password )
// Замеряем время, затраченное на подбор пароля
$begin = time ();
decrypt_md5 ( trim ( $password ), "" );
$end = time ();
" (На подбор затрачено " .( $end - $begin ). " секунд) <br>" ;

// Функция посимвольного перебора пароля
// $pass - расшифровываемый пароль
// $answer - текущий ответ, при первом вызове - пустая строка
function decrypt_md5 ( $pass , $answer )
$arr = array( 'a' , 'b' , 'c' , 'd' , 'e' , 'f' ,
'g' , 'h' , 'i' , 'j' , 'k' , 'l' ,
'm' , 'n' , 'o' , 'p' , 'q' , 'r' , 's' ,
't' , 'u' , 'v' , 'w' , 'x' , 'y' , 'z' );
// Будем считать, что пароль не превышает
// 4 символов
$max_number = 3 ;
strlen ( $answer ) > $max_number ) return;

$j = 0 ; $j < count ( $arr ); $j ++)
$temp = $answer . $arr [ $j ];
md5 ( $temp ) == $pass ) return $temp ;
// Рекурсивно вызываем фукнцию для увеличения
// длины подбираемого пароля
$result = decrypt_md5 ( $pass , $temp );
// Если функция возвращает непустую строку,
// следовательно, найден ответ и дальше искать
// не следует
if( strlen ( $result ) > 0 ) return $result ;

If the password is fairly simple, then with this script you can pick it up quickly on md5 hash. For example, a password of 5 characters in length, consisting of numbers and Latin letters of the lower case, was selected for 10 minutes.

ad0234829205b9033196ba818f7a872b cracked test2 (755 seconds spent on selection)

In general, I have already formatted the array, you can only add Latin characters to the large register, that the campaign will increase the script by about 2 times, but the chances to pick up the password will be much higher. If necessary, you can configure the maximum length of the password to be selected in the script, as well as edit the array of characters used for the selection.

The code does not pretend to be super complicated. The script is more for educational purposes than for practical ones.

By the way: Hash is saved to the root directory in the file password.txt