Difference between revisions of "Parallel FFT-Hash"

Latest revision as of 11:34, 3 November 2008

Variable size
Example
- digest size: 128 bits
- compression function: 128-bit message block, 256-bit chaining variable
Specification:

Claus-Peter Schnorr, Serge Vaudenay - Parallel FFT-Hashing

FSE 809:149-156,1994

Author : Claus-Peter Schnorr, Serge Vaudenay
Title : Parallel FFT-Hashing
In : FSE -
Address :
Date : 1994

@@ Line 1: / Line 1: @@
 == Specification ==
-<!--
+* Variable size
-* digest size: 160 bits
+* Example
-* max. message length: < 2<sup>64</sup> bits
+** digest size: 128 bits
-* compression function: 512-bit message block, 160-bit chaining variable
+<!--** max. message length: < 2<sup>128</sup> bits-->
+** compression function: 128-bit message block, 256-bit chaining variable
 * Specification:
--->
+<bibtex>
+@inproceedings{fseSchnorrV93,
+  author    = {Claus-Peter Schnorr and Serge Vaudenay},
+  title     = {Parallel FFT-Hashing},
+  pages     = {149-156},
+  editor    = {Ross J. Anderson},
+  booktitle = {FSE},
+  publisher = {Springer},
+  series    = {LNCS},
+  volume    = {809},
+  year      = {1994},
+  isbn      = {3-540-58108-1},
+  url       = {http://dx.doi.org/10.1007/3-540-58108-1_18},
+  abstract  = {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.},
+}
+</bibtex>
 == Cryptanalysis ==