Parallel FFT-Hash

From The ECRYPT Hash Function Website

Jump to: navigation, search

Contents

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
In Proceedings of FSE, LNCS 809, pp. 149-156, Springer, 1994
[Electronic Edition] [Bibtex]
Author : Claus-Peter Schnorr, Serge Vaudenay
Title : Parallel FFT-Hashing
In : In Proceedings of FSE -
[Abstract]

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

Personal tools