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


Published in:
Advances in Cryptology - EUROCRYPT '94. Workshop on the Theory and Application of Cryptographic Techniques, 950, 47-57
Presented at:
Advances in Cryptology - EUROCRYPT '94. Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994
Year:
1995
Laboratories:




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

n/a:
Download fulltextPS
External link:
Download fulltextURL
Rate this document:

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