Parallel FFT-hashing

  • C. P. Schnorr
  • S. Vaudenay
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 809)


We propose two families of scalable hash functions for collision-resistant hashing that are highly parallel and based on the generalized fast Fourier transform (FFT). FFT-hashing is based on multipermutations. This is a basic cryptographic primitive for perfect generation of diffusion and confusion which generalizes the boxes of the classic FFT. The slower FFT-hash functions iterate a compression function. For the faster FFT-hash functions all rounds are alike with the same number of message words entering each round.


  1. [LM 91]
    Lai, X. and Massey, J.L.: A proposal of a new block encryption standard. Advances in Cryptology. Eurocrypt'90. Proceedings LNCS 473, pp. 389–404, Springer Verlag, Berlin, 1991.Google Scholar
  2. [S 92]
    Schnorr, C.P.: FFT-Hash II, efficient cryptographic hashing. Proceedings EUROCRYPT'92. Springer LNCS 658 (1992), pp. 45–54.Google Scholar
  3. [V 93]
    Vaudenay, S.: FFT-Hash II is not yet Collision-free. Advances in Cryptology, Proceedings of Crypto'92, Springer LNCS 740, (1993) pp. 587–593.Google Scholar
  4. [SV 93]
    Schnorr, C.P. and Vaudenay, S.: Black Box Cryptanalysis of Hash Networks based on Multipermutations. Technical Report, Universität Frankfurt — ENS Paris, December 1993. Submitted to Eurocrypt'94.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • C. P. Schnorr
    • 1
  • S. Vaudenay
    • 2
  1. 1.Fachbereich Mathematik/InformatikUniversität FrankfurtFrankfurt a.M.
  2. 2.Dép. Math. Inf.ENS ParisParis

Personalised recommendations