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.




Network Security Security-Basics
[Top] [All Lists]

Re: Hashing Functions

Subject: Re: Hashing Functions
Date: Sat, 26 Mar 2005 22:49:54 +0100
On Thu, 24 Mar 2005 10:21:04 -0800, Steven DeFord
<security.willworker@gmail.com> wrote:
I know SHA-1 has been broken.  What does this mean for SHA-n (for n <>
1)?  Are they significantly different algorithms, or something similar
but with longer key length?

SHA-256, SHA-384 and SHA-512 seems to out-of-range for cryptanalists,
at least for the moment.
The fact is that they were recently designed (published by NIST when
AES 128, 192 and 256 keys became widely used, as they make it "easier"
to use), so there is (nearly) nothing published about them.
So, for the moment at least, no problem about using SHA-n (n>1). NIST
was planning (2004/08) to move to SHA-256 or 512 step by step,
finishing in 2010. Seems like they'll have to move faster.

-- 
Julien Gremillot

<Prev in Thread] Current Thread [Next in Thread>