Crypto researchers break SHA-1

It's official

  • alert
  • submit to reddit

Reducing security risks from open source software

Long rumored and now official, the popular SHA-1 hashing algorithm has been attacked successfully by researchers in China and the US. A collision has been discovered in the full version in 269 hash operations, making it just possible to mount a successful brute-force attack with the most powerful machines available today.

This is by no means a disaster in practical terms, as the amount of computational power and mathematical insight needed to perform a successful attack is still great. But SHA-1 has been demonstrated not to be beyond the reach of current supercomputers, as had previously been believed, or at least hoped. Theoretically, 280 operations should be necessary to find a collision.

By using reduced-round versions of the algorithm, and the team's technique, it was possible to attack SHA-1 in fewer than 233 operations. Using the same technique, the full SHA-0 could be attacked in 239 operations.

SHA-1 is regarded as more secure than MD5, in which collisions were found last year by some of the people who reported the recent discovery. Also last year, collisions were found in SHA-0 by a French team.

The researchers in the latest effort, Xiaoyun Wang and Hongbo Yu from Shandong University and Yiqun Lisa Yin from Princeton University, have released a paper briefly outlining their findings. The technical details will be released in the near future. Wang and Yu were part of the team that discovered the weakness in MD5.

Hashing is a one-way cryptographic function. It differs from encryption in that the original input creating the hash should not be recoverable under any circumstances, whereas in encryption, the original input is meant to be recovered, albeit under tightly controlled circumstances. Hashing is used in many applications, from passwords and other authentication schemes, to digital signatures and certificates, to creating checksums used to validate files.

Ideally, no two inputs would create the same hash. However, in the real world this inevitably happens, and when it does, it's called a collision. Finding a collision is a matter of brute-force hashing until two different inputs are found to create the same output. This could, with considerable effort, be used to forge certificates and signatures.

Still, in practical terms, things are not as bad as they might seem. Collisions are irrelevant in a number of crypto implementations, and in those where they are relevant, the trick is to keep them ahead of the practical computing resources required to find them. The chief consequence of these discoveries is that there is now a degree of uncertainty about whether a digital signature, say, is authentic, because it is not impossible for a duplicate to be created. But it's also not likely to happen, either, at least with current technology. Indeed, collisions notwithstanding, the algorithm remains the strongest element of most crypto implementations. It would be wise to approach any encryption or hashing scheme as a fine boost in security that can never be trusted one hundred per cent. Which is exactly how every security scheme should be approached.

The US National Institute of Standards and Technology (NIST) has recently begun recommending that government phase out SHA-1 in favor of SHA-256 and SHA-512.

NIST security technology group manager William Burr was recently quoted in Federal Computer Week saying that, "SHA-1 is not broken, and there is not much reason to suspect that it will be soon."

NIST had been recommending that SHA-1 be phased out by 2010. It looks as if that date will have to be tweaked just a bit. ®

Related stories

Number crunching boffins unearth crypto flaws

Is SSL safe?

Crypto attack against SSL outlined

Weak crypto casts shadow over ecommerce

109-bit Elliptic Curve Cryptography knocked over with brute force

US.gov plans DES's retirement

Mobile application security vulnerability report

More from The Register

next story
LibreSSL RNG bug fix: What's all the forking fuss about, ask devs
Blow to bit-spitter 'tis but a flesh wound, claim team
Manic malware Mayhem spreads through Linux, FreeBSD web servers
And how Google could cripple infection rate in a second
NUDE SNAPS AGENCY: NSA bods love 'showing off your saucy selfies'
Swapping other people's sexts is a fringe benefit, says Snowden
Own a Cisco modem or wireless gateway? It might be owned by someone else, too
Remote code exec in HTTP server hands kit to bad guys
British data cops: We need greater powers and more money
You want data butt kicking, we need bigger boots - ICO
Crooks fling banking Trojan at Japanese smut site fans
Wait - they're doing online banking with an unpatched Windows PC?
NIST told to grow a pair and kick NSA to the curb
Lrn2crypto, oversight panel tells US govt's algorithm bods
prev story


Top three mobile application threats
Prevent sensitive data leakage over insecure channels or stolen mobile devices.
The Essential Guide to IT Transformation
ServiceNow discusses three IT transformations that can help CIO's automate IT services to transform IT and the enterprise.
Mobile application security vulnerability report
The alarming realities regarding the sheer number of applications vulnerable to attack, and the most common and easily addressable vulnerability errors.
How modern custom applications can spur business growth
Learn how to create, deploy and manage custom applications without consuming or expanding the need for scarce, expensive IT resources.
Consolidation: the foundation for IT and business transformation
In this whitepaper learn how effective consolidation of IT and business resources can enable multiple, meaningful business benefits.