zbMATH — the first resource for mathematics

Black box cryptanalysis of hash networks based on multipermutations. (English) Zbl 0909.94013
De Santis, Alfredo (ed.), Advances in cryptology - EUROCRYPT ’94. Workshop on the theory and application of cryptographic techniques, Perugia, Italy, May 9-12, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 950, 47-57 (1995).
Summary: 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.
For the entire collection see [Zbl 0847.00061].

94A60 Cryptography
68P25 Data encryption (aspects in computer science)
05B15 Orthogonal arrays, Latin squares, Room squares