Re: Determining the encryption used

Hello Phoebe,

I'm don't know a lot about these matters, but I was under the
impression that if a password verification system is checking passwords
against a hash table, all you needed was a collision (as this would hash
to the correct value in the table and the comparison of the two would
return true).

Yes, any hash function will be subject to collisions on arbitrary
inputs. However, the vulnerabilities found in MD5 and SHA1 don't
involve taking an existing hash and generating collisions against it.
They involve generating two seperate hashes which have a collision.
This seems like a very minor distinction at first, but it is actually a
very different type of attack.

Normally it should be very difficult to generate any collision at all
against secure hash functions, let alone using useful inputs.

Is this really naive?

Somewhat. A summary of the three desired properties of a hash function
can be found here:
http://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_properties

The collision attacks found can break the security of cryptographic
signatures, since attackers potentially have control over multiple hash
inputs. Where an attacker has control over only one input, (but knows
the value of it), collisions can only be generated by breaking the
second preimage property. Reversing a hash to an original unknown
value, requires a (first) preimage attack.

Collision attacks are much easier to conduct due to the birthday
"paradox". Just because this property of a hash has been broken,
doesn't mean the others have.

HTH,
tim

------------------------------------------------------------------------------
This List Sponsored by: Cenzic

Concerned about Web Application Security?
Why not go with the #1 solution - Cenzic, the only one to win the Analyst's
Choice Award from eWeek. As attacks through web applications continue to rise,
you need to proactively protect your applications from hackers. Cenzic has the
most comprehensive solutions to meet your application security penetration
testing and vulnerability management needs. You have an option to go with a
managed service (Cenzic ClickToSecure) or an enterprise software
(Cenzic Hailstorm). Download FREE whitepaper on how a managed service can
help you: http://www.cenzic.com/news_events/wpappsec.php
And, now for a limited time we can do a FREE audit for you to confirm your
results from other product. Contact us at request@xxxxxxxxxx for details.
------------------------------------------------------------------------------

Relevant Pages

  • Re: Two-stage hashing (pre-hash big integer -> hash-array-index)
    ... > hash value instead of the key to generate the probe sequence. ... avoid all hashes with same home index following same collision chain, ... are the same will follow exactly the same collision chain. ... computes what I call the pre-hash, the large unsigned integer, from the ...
    (comp.programming)
  • Re: Panama hash collision question
    ... > No hash is literally collision free. ... We synchronize database systems by forming a checksum for each record ...
    (sci.crypt)
  • Re: keys and counters
    ... how many times can the counter be incremented before there is a collision in the hash, that is what i am asking. ... A hash function operated in such a counter mode as you suggest does not have this property - if I can guess or discover the input to the first block then I will know all the other blocks. ... You might think that some attacks are unreasonable/infeasible but do you really know what is possible to the world's largest employer of mathematicians, who have had for many years the world's largest computer budget and unlimited access to 60 plus years of classified research or what is possible for any of the other multi-billion dollar "smaller" big brothers?. ...
    (sci.crypt)
  • Re: "Collision for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD"
    ... this was the Year of Doom for cryptographic hash functions. ... These go into great detail on the SHA-0 and MD5 collisions ... Difficulty in the former is called "collision resistance", ... you probably meant to say was "I can find a *different* string whose ...
    (comp.os.linux.security)
  • Re: Panama hash collision question
    ... > I understand that the Panama hash is not collision free: ... No hash is literally collision free. ... resistance in hashes, there are two things that are considered: ...
    (sci.crypt)