Coding and Decoding MD5 / SHA-1, CRC32 Sum, Brut Force, Generation of Word of the Sheet

On this topic:


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

MD5 - The MD5 algorithm is a 128-bit hash algorithm. This means that it calculates a 128-bit hash for an arbitrary set of data arriving at its input. It is intended for creation of "prints" or digests of the message of any length and the subsequent check of their authenticity.

This algorithm was developed by Professor Ronald Rivest of the Massachusetts Institute of Technology in 1991 to replace the less reliable predecessor - MD4. The algorithm was first published in April 1992 in RFC 1321. After that, MD5 was used to solve a variety of tasks, from hashing passwords to CMS to creating digital signatures and SSL certificates.

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.




Hashing with MD5 / SHA-1 and CRC32 checksum

MD5 (Message Digest 5) - 128-bit hash algorithm. MD5 allows you to obtain a relatively reliable identifier for a data block. This property of the algorithm is widely used in various areas, including hashing passwords. The hash contains 128 bits (16 bytes) and is usually represented as a sequence of 32 hexadecimal digits.

SHA-1 (Secure Hash Algorithm 1) is a cryptographic hashing algorithm. For an arbitrary length of input message, the algorithm generates a 160-bit hash value, also called a message digest. Used in many cryptographic applications and protocols.

The tool allows you to get the MD5 and SHA-1 hash and calculate the checksum using the CRC32 algorithm of any string.

Text:

RESET
Внимание
Enter a word or text in a line and clicking on HESHING will get the result of encoding your text.



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

A full search (or "brute force " method ) is a method of solving a problem by looking through all possible options. 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.

Hash MD5:
Symbols:
Delyona words: 1 2 3 4 5 6th 7th 8 9 ? (Unknown)

RESET
Внимание
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

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

RESET
Внимание
In the "Symbols" line, enter the characters from which you want to create a Word list or use the current
In the line "Length of the word", specify the length of the words to be composed.
Click on GENERATION to 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 on the button!
And it's better not to do this, since we'll just bury 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
Cbcntvfc 21881c7e863d8db5770ed0904b15e624
; Jgf D3f47852e1445cba95855825b789ce02
Gfhjkmxbr 987cadce9ef28e63f7cdba0b66eb1371



Password selection on md5 [php] script

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

// Читаем пароли из файла password
$pass = file ( "password.txt" );
foreach(
$pass as $password )
{
// Замеряем время, затраченное на подбор пароля
$begin = time ();
echo
decrypt_md5 ( trim ( $password ), "" );
$end = time ();
echo
" (На подбор затрачено " .( $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 ;
if(
strlen ( $answer ) > $max_number ) return;

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


Внимание

If the password is fairly simple, then using this script you can quickly pick it up on md5 hash.

For example, a password of 5 characters in length, consisting of digits and lowercase Latin letters, was selected for 10 minutes.

Ad0234829205b9033196ba818f7a872b cracked test2 (755 seconds spent on selection)

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 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 work of the script by about 2 times, but the chances to pick up the password will be much higher.

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

The script is more for learning purposes than for practical ones.