Difference between revisions of "FFT-Hash II"
From The ECRYPT Hash Function Website
Crechberger (talk | contribs) (→Collision Attacks) |
(→Specification) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 17: | Line 17: | ||
abstract = {We propose an efficient algorithm that hashes messages of arbitrary bit length into an 128 bit hash value. The algorithm is designed to make the production of a pair of colliding messages computationally infeasible. The algorithm performs a discrete Fourier transform and a polynomial recursion over a finite field. Each hash value in {0, 1}128 occurs with frequency at most 2-120. This hash function is an improved variant of the algorithm FFT-hash I presented in the rump session of CRYPTO’91.}, | abstract = {We propose an efficient algorithm that hashes messages of arbitrary bit length into an 128 bit hash value. The algorithm is designed to make the production of a pair of colliding messages computationally infeasible. The algorithm performs a discrete Fourier transform and a polynomial recursion over a finite field. Each hash value in {0, 1}128 occurs with frequency at most 2-120. This hash function is an improved variant of the algorithm FFT-hash I presented in the rump session of CRYPTO’91.}, | ||
url = {http://link.springer.de/link/service/series/0558/bibs/0658/06580045.htm}, | url = {http://link.springer.de/link/service/series/0558/bibs/0658/06580045.htm}, | ||
| + | editor = {Rainer A. Rueppel}, | ||
| + | series = {LNCS}, | ||
| + | volume = {658}, | ||
| + | year = {1993}, | ||
} | } | ||
</bibtex> | </bibtex> | ||
Latest revision as of 14:59, 10 November 2008
Contents
1 Specification
Claus-Peter Schnorr - FFT-Hash II, Efficient Cryptographic Hashing
- EUROCRYPT 658:45-54,1993
- http://link.springer.de/link/service/series/0558/bibs/0658/06580045.htm
BibtexAuthor : Claus-Peter Schnorr
Title : FFT-Hash II, Efficient Cryptographic Hashing
In : EUROCRYPT -
Address :
Date : 1993
2 Cryptanalysis
2.1 Best Known Results
2.2 Generic Attacks
2.3 Collision Attacks
Serge Vaudenay - FFT-Hash-II is not yet Collision-free
- CRYPTO 740:587-593,1992
- http://link.springer.de/link/service/series/0558/bibs/0740/07400587.htm
BibtexAuthor : Serge Vaudenay
Title : FFT-Hash-II is not yet Collision-free
In : CRYPTO -
Address :
Date : 1992
