http://www.redcode.nl/blog/2010/01/md5-fixed-point/?utm_source=rss&utm_medium=rss&utm_campaign=md5-fixed-point Java, algorithms, math and more Fri, 03 Feb 2012 15:06:43 +0000 hourly 1 http://wordpress.org/?v=3.3.1 http://www.redcode.nl/blog/2010/01/md5-fixed-point/comment-page-1/#comment-893 Spider Fri, 10 Sep 2010 01:42:39 +0000 http://www.redcode.nl/?p=217#comment-893 I don't think you will find a loop. Hashes are like irrational numbers, always new values. But if you can find the nth term of an irrational number then you can find the expression that computes the hash value and find the nth term. I don’t think you will find a loop.
Hashes are like irrational numbers, always new values.
But if you can find the nth term of an irrational number then you can find the expression that computes the hash value and find the nth term.

]]> http://www.redcode.nl/blog/2010/01/md5-fixed-point/comment-page-1/#comment-59 Kuroki Kaze Thu, 21 Jan 2010 11:27:01 +0000 http://www.redcode.nl/?p=217#comment-59 Actually, theoretically there can be multiple fixed points. But we need some clever algorithm to find that. Actually, theoretically there can be multiple fixed points. But we need some clever algorithm to find that.

]]> http://www.redcode.nl/blog/2010/01/md5-fixed-point/comment-page-1/#comment-45 John Sat, 09 Jan 2010 13:53:26 +0000 http://www.redcode.nl/?p=217#comment-45 Interesting. Your approach reminds me of Collatz's Sequence. Interesting. Your approach reminds me of Collatz’s Sequence.

]]> http://www.redcode.nl/blog/2010/01/md5-fixed-point/comment-page-1/#comment-36 Jan-Kees van Andel Tue, 05 Jan 2010 18:39:03 +0000 http://www.redcode.nl/?p=217#comment-36 Maybe you could also consult running a query on a Rainbow Table? Maybe you could also consult running a query on a Rainbow Table?

]]>