Difference between revisions of "FFT-Hash II"

From The ECRYPT Hash Function Website
(Specification)
 
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