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 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.


Published in:
Fast Software Encryption, Cambridge Security Workshop, 809, 149-156
Presented at:
Fast Software Encryption, Cambridge Security Workshop, Cambridge, UK, December 9-11, 1993
Year:
1993
Laboratories:




 Record created 2007-01-18, last modified 2018-03-17

n/a:
Download fulltext
PS

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)