Re: SHA-1 in 2**52

2009-06-16 Thread Hal Finney
Differential Path for SHA-1 with complexity O(2**52) Cameron McDonald, Philip Hawkes, and Josef Pieprzyk Macquarie University http://eprint.iacr.org/2009/259.pdf I wonder now with this new improved differential path if any distributed computations may be forming to finally create a SHA-1

SHA-1 in 2**52

2009-06-14 Thread I)ruid
Differential Path for SHA-1 with complexity O(2**52) Cameron McDonald, Philip Hawkes, and Josef Pieprzyk Macquarie University http://eprint.iacr.org/2009/259.pdf -- I)ruid, CĀ²ISSP dr...@caughq.org http://druid.caughq.org signature.asc Description: This is a digitally signed message part