Re: Revert MD4

2^128 (you write this right?) are teorically possibles COLLISIONS that means that a file has the same hash value as the original but with a infinite range of length.
For example a file of 3 Mb may have a collision in a 300 Kb file as in a 2 Tb file!!!
If I close the range of possibilities fixing the length I can find (at leas one if the length is the same as the original) very fewer collisions!
I mean a MD4 in a not-so-hostile environment where you have some information about the original file.
.

Relevant Pages

  • Re: When will md5crk complete?
    ... and in that case birthday attack ... > His core message is correct however: you shouldn't be using MD5. ... Collisions DO exist for every hash algorithm... ...
    (sci.crypt)
  • Re: Hashing
    ... Computing the hash function, which is handled by the instructions: ... reserved word/identifier when searching through the reserved words ... collisions and four slots that have four collisions. ...
    (alt.lang.asm)
  • Re: Hashing
    ... A good hash ... > greater is it better performance due to less collisions". ... then the probability that you need a rehash on any scan is something ... > 'hash method' simply because they use hash codes, ...
    (alt.lang.asm)
  • Re: CHECKSUM() question
    ... Let's assume for a moment that you use CHECKSUM and that there are hash collisions. ... If you stage the answer in a temporary table, you can use that to join to your source table, then filter out the few collisions. ... Remember absolutely no hash that reduces the size of data for searching can be guaranteed to avoid a collision. ... However, from a private discussion, Steve Kass pointed out that HASHBYTES with MD5 for 300 million rows probably has a lower chance of collision than the the possibility that some bit will get randomly changed by some other influence. ...
    (microsoft.public.sqlserver.programming)
  • Re: Collision in SHA-0
    ... The entity requesting the certificate can often ... >able to find collisions in the underlying hash function, ... There are collisions and then there are collisions. ... same length as a cert and the same hash. ...
    (sci.crypt)