I am a bit concerned about your choice of wording in a couple of ways. The md5 algorithm does NOT output a 32-character string. Its output is a 128-bit binary number, which is commonly represented in hexadecimal for human readability. Consider the differences of the following cases:
md5(X) == X
For this to be true, X must be a 128-bit value.
This is not the same as the following:
bin2hex(md5('string')) == 'string'
Which is what the Kember Identity Search is actually seeking. It is clear you are working with 32-character strings, not with 128-bit numbers, as the input to the md5 function, and thus are not seeking md5(X) == X.
That is not to say it would not be interesting to find such a string! You might also want to consider that the actual input values you are working with are directly dependent upon your character encoding. Different encoding schema will produce entirely different result sets.
Demi
· 3 months ago
I've just burnt a rented server, after 3 days of computations the CPU went on fire. Greetz
All Comments
Consider the differences of the following cases:
md5(X) == X
For this to be true, X must be a 128-bit value.
This is not the same as the following:
bin2hex(md5('string')) == 'string'
Which is what the Kember Identity Search is actually seeking. It is clear you are working with 32-character strings, not with 128-bit numbers, as the input to the md5 function, and thus are not seeking md5(X) == X.
That is not to say it would not be interesting to find such a string! You might also want to consider that the actual input values you are working with are directly dependent upon your character encoding. Different encoding schema will produce entirely different result sets.
Greetz