Parallel FFT Hashing

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 
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 di®usion 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.
show moreshow less

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

    Share in Twitter Search Google Scholar
Metadaten
Author:Claus Peter Schnorr, Serge Vaudenay
URN:urn:nbn:de:hebis:30-12308
Document Type:Article
Language:English
Date of Publication (online):2005/07/12
Year of first Publication:1994
Publishing Institution:Univ.-Bibliothek Frankfurt am Main
Release Date:2005/07/12
Source:Lecture Notes in Computer Science, Vol. 809, Springer Verlag, pp.149-156,1994 , http://www.mi.informatik.uni-frankfurt.de/research/papers.html
HeBIS PPN:348061897
Institutes:Mathematik
Informatik
Dewey Decimal Classification:510 Mathematik
Sammlungen:Universitätspublikationen
Licence (German):License Logo Veröffentlichungsvertrag für Publikationen

$Rev: 11761 $