Schnorr, Claus-PeterVaudenay, Serge2007-01-182007-01-182007-01-18199310.1007/3-540-58108-1_18https://infoscience.epfl.ch/handle/20.500.14299/239650We 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.text::conference output::conference proceedings::conference paper