Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^2: On showing the weakness in the MD5 digest function and getting bitten by scalar context

by hardburn (Abbot)
on Aug 27, 2004 at 16:47 UTC ( [id://386426]=note: print w/replies, xml ) Need Help??


in reply to Re: On showing the weakness in the MD5 digest function and getting bitten by scalar context
in thread On showing the weakness in the MD5 digest function and getting bitten by scalar context

If you're thinking about this from a mathmatical point of view, then this is a very big deal. Cryptographic hashes have the properties of being 1) hard to reverse, and 2) hard to find a collision. Since #2 is now violated, any algorithms that assumed #2 is true is now a broken algorithm (as well as any algorithms based on those algorithms, and so on).

Does it change practical uses of hashes? Maybe. It depends on your application.

"There is no shame in being self-taught, only in not trying to learn in the first place." -- Atrus, Myst: The Book of D'ni.

  • Comment on Re^2: On showing the weakness in the MD5 digest function and getting bitten by scalar context

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://386426]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others contemplating the Monastery: (5)
As of 2024-04-25 18:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found