TY  - JOUR
A1  - Schnorr, Claus Peter
A1  - Vaudenay, Serge
A2  - Anderson, Ross
T1  - Parallel FFT-hashing
N2  - 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.
KW  - Kryptosystem
KW  - Kongress
Y1  - 2005
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4260
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12308
SN  - 3-540-58108-1
SN  - 0-387-58108-1
SN  - 978-0-387-58108-8
SN  - 978-3-540-58108-6
N1  - 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
SP  - 1
EP  - 9
ER  -