Difference between revisions of "FFT-Hash II"
From The ECRYPT Hash Function Website
Mschlaeffer (talk | contribs) |
Mschlaeffer (talk | contribs) |
||
| Line 7: | Line 7: | ||
* Specification: | * Specification: | ||
--> | --> | ||
| + | |||
| + | <bibtex> | ||
| + | @inproceedings{eurocryptSchnorr92, | ||
| + | author = {Claus-Peter Schnorr}, | ||
| + | title = {FFT-Hash II, Efficient Cryptographic Hashing}, | ||
| + | booktitle = {EUROCRYPT}, | ||
| + | year = {1992}, | ||
| + | pages = {45-54}, | ||
| + | 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}, | ||
| + | } | ||
| + | </bibtex> | ||
== Cryptanalysis == | == Cryptanalysis == | ||
Revision as of 12:14, 11 March 2008
Contents
1 Specification
Claus-Peter Schnorr - FFT-Hash II, Efficient Cryptographic Hashing
- EUROCRYPT pp. 45-54,1992
- 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 : 1992
