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.
- Schnorr, C.P. and Vaudenay, S.: Parallel FFT-Hashing. Proceedings of Cambridge Security Workshop, Cambridge, December 9–11, 1993. to appear in Springer LNCS, Ed.: R. Anderson.Google Scholar