Difference between revisions of "SHA-1"
From The ECRYPT Hash Function Website
(→Cryptanalysis) |
|||
| Line 14: | Line 14: | ||
=== Second Preimage Attacks === | === Second Preimage Attacks === | ||
| − | + | There exists a generic attack (works for all iterated hash functions). See .... | |
=== Preimage Attacks === | === Preimage Attacks === | ||
| − | We are not aware of any article | + | We are not aware of any article describing preimage attacks on SHA-1. |
== eHASH Recommendation == | == eHASH Recommendation == | ||
| − | |||
Something like: SHA-1 is considered to be broken. Please do not incorporate SHA-1 in new application any longer. Try to migrate to another hash function. | Something like: SHA-1 is considered to be broken. Please do not incorporate SHA-1 in new application any longer. Try to migrate to another hash function. | ||
Revision as of 13:16, 16 October 2006
Contents
1 General
- type: iterative hash function
- compression function: 512-bit message block, 160-bit chaining variable
- max. message length: < 264 bits
- Specification: FIPS 180-2 Secure Hash Standard
2 Cryptanalysis
2.1 Collision Attacks
Here I would list all papers that deal with SHA-1. We should also give the abstract and the bibtex entry for the corresponding paper. Additionall we should give our opinion about the attack described in the paper.
2.2 Second Preimage Attacks
There exists a generic attack (works for all iterated hash functions). See ....
2.3 Preimage Attacks
We are not aware of any article describing preimage attacks on SHA-1.
3 eHASH Recommendation
Something like: SHA-1 is considered to be broken. Please do not incorporate SHA-1 in new application any longer. Try to migrate to another hash function.
