Difference between revisions of "Parallel FFT-Hash"

From The ECRYPT Hash Function Website
(Specification)
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
 
== Specification ==
 
== Specification ==
  
+
* Variable size
* digest size: 128 bits
+
* Example
* max. message length: < 2<sup>64</sup> bits
+
** digest size: 128 bits
* compression function: 128-bit message block, 256-bit chaining variable
+
<!--** max. message length: < 2<sup>128</sup> bits-->
 +
** compression function: 128-bit message block, 256-bit chaining variable
 
* Specification:  
 
* Specification:  
  

Latest revision as of 11:34, 3 November 2008

1 Specification

  • 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
http://dx.doi.org/10.1007/3-540-58108-1_18
Bibtex
Author : Claus-Peter Schnorr, Serge Vaudenay
Title : Parallel FFT-Hashing
In : FSE -
Address :
Date : 1994

2 Cryptanalysis

2.1 Best Known Results


2.2 Generic Attacks


2.3 Collision Attacks


2.4 Second Preimage Attacks


2.5 Preimage Attacks


2.6 Others