Ethical Hacking Learn to find vulnerabilities before the bad guys do! Gain real world hands on hacking experience in our state of the art hacking lab. Course designed and taught by expert instructors with years of penetration testing experience. 12 student maximum in every class. Certification attempt included in every package. | Computer Forensics Training at InfoSec Institute Gain the in-demand skills of a certified computer examiner, learn to recover trace data left behind by fraud, theft, and cybercrime perpetrators. Discover the source of computer crime and abuse at your organization so that it never happens again. All of our class sizes are guaranteed to be 12 students or less to facilitate one-on-one interaction with one of our expert instructors. |

| Subject: | Re: sha-1 cryptography |
|---|---|
| Date: | Fri, 23 Dec 2005 15:04:49 +0000 |
2005-12-20T18:37:20 Enquiries:
I understand that SHA-1 cryptography has been broken [...]
It was broken according to part of the strict definition of a crypto hash: there's an attack that can find a pair of inputs that collide in something less than order of 2**80 tries. I forget the exact savings the current attack achieves, but I think it's still big enough that nobody's demonstrated an actual collision. And if they do, this only affects some, not all applications. Current apps using SHA-1 aren't vulnerable, yet. All new protocol designs should include pluggable hash protocols, to make it easy to upgrade, and the default for new designs should be one of the SHA-2 family, I'm using SHA-256. Some constructions are still safe, and expect to remain safe, even with MD5 for which actual collisions have been demonstrated; e.g. HMAC isn't busted. And passwd hashing with MD5 isn't busted yet; the current attacks don't help in finding an input text that matches a fixed hash, only in finding an arbitrary pair that collide. But as the saying goes, it never gets harder to bust a partially-attacked algorithm, only easier. -Bennett
pgpnGaaeKLLQ1.pgp
Description: PGP signature
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | Re: Cracking simple password encryption, jim |
|---|---|
| Next by Date: | RE: Applying Group Policies to selective OUs..., Jim Gaudet |
| Previous by Thread: | RE: sha-1 cryptography, David Gillett |
| Next by Thread: | Re: sha-1 cryptography, Saqib Ali |
| Indexes: | [Date] [Thread] [Top] [All Lists] |