论文信息 - Multidimensional linear distinguishing attacks and Boolean functions

Multidimensional linear distinguishing attacks and Boolean functions

In this paper theoretical aspects of multidimensional linear distinguishing attacks are investigated. Using kno wn examples of highly nonlinear Boolean functions we demonstrate h ow multidimensional linear approximations o ffer significant reduction in data complexity in distinguishing attacks. We also get co ncrete examples where one-dimensional linear approximations are nev r statistically independent.

Jean-Francis Michon | Jean-Baptiste Yunès | Pierre Valarcher

[1] Alexander Maximov,et al. Attack the Dragon , 2005, INDOCRYPT.

[2] Thomas M. Cover,et al. Elements of information theory (2. ed.) , 2006 .

[3] Tor Helleseth,et al. An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators , 2004, CRYPTO.

[4] Kaisa Nyberg,et al. Linear Approximation of Block Ciphers , 1994, EUROCRYPT.

[5] Kaisa Nyberg,et al. Multidimensional Linear Cryptanalysis of Reduced Round Serpent , 2008, ACISP.

[6] Serge Vaudenay,et al. How Far Can We Go Beyond Linear Cryptanalysis? , 2004, ASIACRYPT.

[7] Matthew J. B. Robshaw,et al. Linear Cryptanalysis Using Multiple Approximations and FEAL , 1994, FSE.

[8] Kaisa Nyberg,et al. Multidimensional Walsh Transform and a Characterization of Bent Functions , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[9] Kaisa Nyberg,et al. Correlation Theorems in Cryptanalysis , 2001, Discret. Appl. Math..

[10] Joos Vandewalle,et al. Correlation Matrices , 1994, FSE.

[11] Mitsuru Matsui,et al. Linear Cryptanalysis Method for DES Cipher , 1994, EUROCRYPT.