Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

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

by iburrell (Chaplain)
on Aug 27, 2004 at 21:34 UTC ( [id://386498]=note: print w/replies, xml ) Need Help??


in reply to Re^4: 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

You are missing the point of the attack. One of the main properties of a cryptographic hash is that is hard to FIND a collision. There are certainly collisions, but with a secure hash function and a large enough size, it is practically impossible to find another input that produces the same hash. This is very important for many cryptographic protocols.

This attack takes finding an MD5 hash collision from difficult brute force to relatively easy. This doesn't matter too much for many uses of MD5 where security isn't important.

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

Replies are listed 'Best First'.
Re^6: On showing the weakness in the MD5 digest function and getting bitten by scalar context
by BrowserUk (Patriarch) on Aug 27, 2004 at 22:06 UTC

    Maybe I am? Did you find something somewhere that suggested that they could start with an md5 and generate a plaintext with that md5?

    What I read, led me to believe that what they were saying is that they had discovered a way to take one piece of plain text, generate its md5, and then by manipulating the original plaintext, generate another plaintext with the same md5.

    But note. If I read it right, they need the original text to produce the new one.

    For password applications, this means they would need the original password in order to produce another piece of text that had the same md5. But why bother when you have the original password?

    So what other vulnerabilities arise from this discovery? If they start with the source or binary of some application that is downloadable and is checksummed with md5. They produce a modified version of that binary with the same md5. Will it run? Will it open a known port and listen for mother? Will it monitor the keyboard for passwords?

    Or, they have the text of an important message and it's md5. They produce a different message with the same md5. Will it cause the bank to transfer funds to their bank account? Or recall the nuclear bombers? Instruct the enemies operative in Washington to fall into the counter espionage trap at the cafe? Will it even be readable as English (French, German, Chinese or Swahili)?

    If the md5 is being used to stop them from knowing the text it was generated from (password), and they need to know that password to exploit the md5--no vulnerability.

    If there is open access to the plaintext, and the md5 is designed to ensure that the plaintext hasn't been altered, they can produce another plaintext with the same md5, but will it make any sense? Never mind actually do anything subversive, or to their advantage.

    Maybe I misunderstood what I read? Maybe, there is an application that allows the fact the the alternative plaintext is gibberish to be ignored and compromise something?


    Examine what is said, not who speaks.
    "Efficiency is intelligent laziness." -David Dunham
    "Think for yourself!" - Abigail
    "Memory, processor, disk in that order on the hardware side. Algorithm, algorithm, algorithm on the code side." - tachyon
      Maybe I misunderstood what I read? Maybe, there is an application that allows the fact the the alternative plaintext is gibberish to be ignored and compromise something?
      Don't know if I got that correctly, but sabotaging a p2p network could be such an application. If a p2p network uses hashes to identify files, you could use this weakness to supply gibberish data (parts) to prevent successful downloads.

        Yes, I think that would work.

        A workaround might be quite easy though.

        Produce 2 md5s. One from the whole file and another from the file minus 1 byte (first, last or middle). Or make the second md5 just the first half of the file; or from just the 10th, 20th, 30th etc. bytes (or whichever bytes the attack modifies to compromise the md5).

        Now the attackers not only have the task of finding a duplicate file with the same md5, they have to produce one that matches two md5s.

        Again, my math lets me down, but doesn't that make their job much, *much* harder?


        Examine what is said, not who speaks.
        "Efficiency is intelligent laziness." -David Dunham
        "Think for yourself!" - Abigail
        "Memory, processor, disk in that order on the hardware side. Algorithm, algorithm, algorithm on the code side." - tachyon

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others imbibing at the Monastery: (4)
As of 2024-04-19 23:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found