Ken's blog
mostly on computers and mathematics
Wednesday, November 16, 2005
Adi Shamir's Discrete Logarithm Hash Function
With a lot more work, you can get a hash function with provable strength.
Adi Shamir's Discrete Logarithm Hash Function
(Archive)
1 comment :
Ken
said...
http://diswww.mit.edu/bloom-picayune/crypto/13190
7/02/2009 8:54 AM
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments ( Atom )
1 comment :
http://diswww.mit.edu/bloom-picayune/crypto/13190
Post a Comment