Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

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

by danderson (Beadle)
on Aug 27, 2004 at 21:47 UTC ( #386501=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

Edit: tachyon updated to fix. Leaving my comment for posterity, but it no longer applies.

Sorry Tachyon, but you're wrong. In roughly 2^16 tries, you've got 50% odds of finding a collision - not 50% odds of finding a collision with a given result. So you have 50% odds of two numbers in the 2^16 tries colliding, but you do not have 50% odds of a number in the 2^16 tries colliding with the result of one specific output.

You've mistaken "collision with a given point" with "collision between any two points." ++ for bringing up the birthday paradox, anyways.


Comment on Re^2: On showing the weakness in the MD5 digest function and getting bitten by scalar context
Re^3: On showing the weakness in the MD5 digest function and getting bitten by scalar context
by tachyon (Chancellor) on Aug 27, 2004 at 23:43 UTC

    Of course you are right about finding a specific collision. I have had non specific collisions on my mind recently.

    cheers

    tachyon

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (8)
As of 2014-12-26 04:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (165 votes), past polls