yes, but that is not quite how it works.
perhaps an an example of some of my results would clarify.. A dictionary of 2-character long words has been analysed (using a->z,A->Z,0->9, and 32 symbols). The hashes of all these words was generated in real-time, and analysed. The 'aa'/'ab' etc is the pattern in a hash, and the character that come after are the most common plaintext characters found in hashes which contain said pattern.
So, using these results, if you, say, had a hash of "b30a87fed34c4aa
0bc61", then you could try to find the most common plaintext letters using patterns in the hash. Using the 'aa' in the above hash, then, reviewing the table above, one can see that the most common character would be 'C', followed by '%' and 'R'. The 'a3' in the hash would show that the character 'f' is most common with hashes containing that pattern.
So a program may find the most common plaintext character by consulting this table and examining all possible patterns in a specific hash. Hope this clarifies things. Im welcome to feedback
-- Sun Jul 05, 2009 7:17 pm --
perhaps a downloadable version would be helpfull...
Binary statistical hash cracker (will only generate statistics and analyse a specified hash)
>The statistics were generated using the plaintext.txt file - so when analysing hashes, try to use two-length character plaintext words. (ie, any word from the plaintext.txt file)
>please keep in mind this is still completely in developement, and has only been made for personal use, and may contain many errors/bugs, if you find any, let me know
>This has been compiled under windows, sorry! Shouldnt be too hard to convert to linux code, maybe I will if there's enough interest.
>To analyse your own MD5 hash, run the program, type 'a', then type '2', then enter your MD5 hash. (Should work fine)
>Generating statistics might not work properly at the moment.. unless you edit the source code.
Source Code (c++):
>Please keep in mind its made for windows
>Any suggestions/ideas let me know
>May not be very well documented, once again, sorry bout that!
Some Other information: