View source for Parallel FFT-Hash

From The ECRYPT Hash Function Website

← Parallel FFT-Hash

You do not have permission to edit this page, for the following reason:

---

You can view and copy the source of this page.

== Specification == * Variable size * Example ** digest size: 128 bits <!--** max. message length: < 2¹²⁸ 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 == === Best Known Results === ---- === Generic Attacks === * [[GenericAttacksMerkleDamgaard| Generic Attacks on the Merkle-Damgaard Construction ]] ---- === Collision Attacks === ---- === Second Preimage Attacks === ---- === Preimage Attacks === ---- === Others ===

Return to Parallel FFT-Hash.