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.
Author:Claus Peter SchnorrGND, Serge Vaudenay
Editor:Ross Anderson
Document Type:Article
Date of Publication (online):2005/07/12
Year of first Publication:1994
Publishing Institution:Universit├Ątsbibliothek Johann Christian Senckenberg
Release Date:2005/07/12
GND Keyword:Kryptosystem; Kongress
Page Number:9
First Page:1
Last Page:9
Erschienen in: Ross Anderson (Hrsg.): Fast software encryption, Teil: [1.], Cambridge, UK, December 9 - 11, 1993, Berlin ; Heidelberg ; Singapore ; New York ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Santa Clara : Springer, 1994, Lecture notes in computer science ; Vol. 809, S. 149-156, ISBN: 978-3-540-58108-6, ISBN: 3-540-58108-1, ISBN: 978-0-387-58108-8, ISBN: 0-387-58108-1, doi:10.1007/3-540-58108-1_18
Source:Lecture notes in computer science, Vol. 809,
Institutes:Informatik und Mathematik / Mathematik
Informatik und Mathematik / Informatik
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):License LogoDeutsches Urheberrecht