Distinguishing properties and applications of higher order derivatives of Boolean functions

Abstract Higher order differential cryptanalysis is based on a property of higher order derivatives of Boolean functions such that derivative of a Boolean function reduces its degree at least 1 and continuously taking derivatives eventually yields a zero function. A quicker degree reduction means a lower data complexity in cryptanalysis, which can be determined by fast point at which the derivative reduces the degree at least 2. In this paper, we show that the set of the fast points of a Boolean function constitutes a linear subspace and its dimension plus the degree of the function is at most the size of the function. We also show that non-zero fast point exists in every n -variable Boolean function of degree n - 1 , every symmetric Boolean function of degree d where n ≢ d ( mod 2 ) or every quadratic Boolean function of odd number variables, which help us distinguish a few block ciphers and propose a new design principle about degree for block cipher.

[1]  Michael Luby,et al.  How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.

[2]  Anne Canteaut.  Cryptographic Functions and Design Criteria for Block Ciphers , 2001, INDOCRYPT.

[3]  Bo Zhu,et al.  Bitwise Higher Order Differential Cryptanalysis , 2009, INTRUST.

[4]  Eli Biham,et al.  Differential cryptanalysis of DES-like cryptosystems , 1990, Journal of Cryptology.

[5]  Anne Canteaut,et al.  Higher-Order Differential Properties of Keccak and Luffa , 2011, FSE.

[6]  Lars R. Knudsen,et al.  Truncated and Higher Order Differentials , 1994, FSE.

[7]  Michael Vielhaber.  Breaking ONE.FIVIUM by AIDA an Algebraic IV Differential Attack , 2007, IACR Cryptol. ePrint Arch..

[8]  Vincent Rijmen,et al.  The Block Cipher Square , 1997, FSE.

[9]  Xuejia Lai,et al.  On the security of multivariate hash functions , 2009 .

[10]  Takeshi Kawabata,et al.  Higher Order Differential Attacks on Reduced-Round MISTY1 , 2008, ICISC.

[11]  Xuejia Lai,et al.  Improved zero-sum distinguisher for full round Keccak-f permutation , 2011, IACR Cryptol. ePrint Arch..

[12]  Lars R. Knudsen,et al.  Provable security against a differential attack , 1994, Journal of Cryptology.

[13]  Stefan Lucks.  The Saturation Attack - A Bait for Twofish , 2000, FSE.

[14]  Toshinobu Kaneko,et al.  Higher Order Differential Attak of CAST Cipher , 1998, FSE.

[15]  Toshinobu Kaneko,et al.  Improving the Higher Order Differential Attack and Cryptanalysis of the KN Cipher , 1997, ISW.

[16]  David A. Wagner,et al.  Integral Cryptanalysis , 2002, FSE.

[17]  Jan-Hendrik Evertse,et al.  Linear Structures in Blockciphers , 1987, EUROCRYPT.

[18]  Jonathan L. Alperin,et al.  Groups and Representations , 1995 .

[19]  Yasuo Hatano,et al.  Higher Order Differential Attack on Step-Reduced Variants of Luffa v1 , 2010, FSE.

[20]  Xuejia Lai,et al.  Higher order differential cryptanalysis framework and its applications , 2011, International Conference on Information Science and Technology.

[21]  Adi Shamir,et al.  Cube Attacks on Tweakable Black Box Polynomials , 2009, IACR Cryptol. ePrint Arch..

[22]  Anne Canteaut,et al.  Symmetric Boolean functions , 2005, IEEE Transactions on Information Theory.

[23]  Xuejia Lai.  Higher Order Derivatives and Differential Cryptanalysis , 1994 .

[24]  Yehuda Lindell,et al.  Introduction to Modern Cryptography , 2004 .