Black Box Cryptanalysis of Hash Networks based on Multipermutations

  • Black box cryptanalysis applies to hash algorithms consisting of many small boxes, connected by a known graph structure, so that the boxes can be evaluated forward and backwards by given oracles. We study attacks that work for any choice of the black boxes, i.e. we scrutinize the given graph structure. For example we analyze the graph of the fast Fourier transform (FFT). We present optimal black box inversions of FFT-compression functions and black box constructions of collisions. This determines the minimal depth of FFT-compression networks for collision-resistant hashing. We propose the concept of multipermutation, which is a pair of orthogonal latin squares, as a new cryptographic primitive that generalizes the boxes of the FFT. Our examples of multipermutations are based on the operations circular rotation, bitwise xor, addition and multiplication.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Claus Peter SchnorrGND, Serge Vaudenay
URN:urn:nbn:de:hebis:30-12310
Document Type:Report
Language:English
Date of Publication (online):2005/07/12
Year of first Publication:1994
Publishing Institution:Universit├Ątsbibliothek Johann Christian Senckenberg
Release Date:2005/07/12
Issue:April 1994
Source:Advances in Cryptology - Eurocrypt '94 Lecture Notes in Computer Science, Vol.950, Springer Verlag,1995 , Technical Report 94-017, ICSI, Berkeley, CA, 1994 , http://www.icsi.berkeley.edu/techreports/1994.abstracts/tr-94-017.html , http://www.mi.informatik
HeBIS-PPN:404296947
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