August 19th, 2005, 08:47 PM
SHA-1 compromised further
Crypto researchers have discovered a new, much faster, attack against the widely-used SHA-1 hashing algorithm. Xiaoyun Wang, one of the team of Chinese cryptographers that demonstrated earlier attacks against SHA-0 and SHA-1, along with Andrew Yao and Frances Yao, have discovered a way to produce a collision in SHA-1 over just 2^63 hash operations compared to 2^69 hash operations previously. A brute force attack should take 2^80 operations.
EDIT: oops. Fixed.
\"If computers are to become smart enough to design their own successors, initiating a process that will lead to God-like omniscience after a number of ever swifter passages from one generation of computers to the next, someone is going to have to write the software that gets the process going, and humans have given absolutely no evidence of being able to write such software.\" -Jaron Lanier
August 19th, 2005, 09:04 PM
For people that just glance and don't the article that's 2^63, 2^69 and 2^80... I looked at it at first and was like wtf.. that seems a little quick... Also the difference between 263 and 269 isn't much but between 2^63 and 2^69 is huge.
IT Blog: .:Computer Defense:.
(Pronounced Pinched): Acronym - Point 'n Click Hacked. As in: "That website was pinched" or "The skiddie pinched my computer because I forgot to patch".