Low order approximation of cipher functions
We present an algorithm allowing the rapid identification of low order nonlinear Boolean functions. An extension of the method allowing the identification of good low order approximations (if they exist) is then described. We discuss the application of the method to cryptanalysis of black-box cipher functions. We present results indicating that the method can be expected to perform better than random search in locating good low order approximating Boolean functions. An expression for the effectiveness of the attack is derived, and it is shown that highly nonlinear balanced Boolean functions constructed as modified low order bent functions are particularly vulnerable to the attack. The required tradeoff in resisting both linear and quadratic approximation is also discussed.
Unable to display preview. Download preview PDF.
- H. Dobbertin, ”Construction of Bent Functions and Balanced Boolean Functions with High Nonlinearity”, presented at K.U.Leuven Workshop on Cryptographic Algorithms, 1994.Google Scholar
- X. Lai, ”Higher Order Derivatives and Differential Cryptanalysis”, in Communications And Cryptography, Two Sides of One Tapestry, pp.227–233, Kluwer Academic Publishers, 1994.Google Scholar
- F.J. MacWilliams, N.J.A. Sloane ”The Theory of Error Correcting Codes”, North Holland Publishing Company, 1977.Google Scholar
- U.M. Maurer, ”New Approaches to the Design of Self-Synchronizing Stream Ciphers”, EUROCRYPT '91, Lecture Notes in Computer Science, vol.547, pp. 458–471, Springer-Verlag, Berlin, New York, Tokyo, 1991.Google Scholar
- W. Meier, O. Staffelbach ”Nonlinearity Criteria for Cryptographic Functions”, EUROCRYPT'89, Lecture Notes in Computer Science, vol.434, pp. 549–562, Springer-Verlag, Berlin, Heidelberg, New York, 1990.Google Scholar
- W. Millan, E.P. Dawson, L.J. O'Connor, ”Fast Attacks on Tree-Structured Ciphers”, Proceedings of Workshop on Selected Areas in Cryptography (SAC'94), pp. 148–158, Queens University, Kingston, Canada, May 1994.Google Scholar
- B. Preneel, W. Van Leekwijck, L. Van Linden, R. Govaerts, J. Vanderwalle, ”Propagation Characteristics of Boolean Functions”, EUROCRYPT'90, Lecture Notes in Computer Science, vol.473, pp. 161–173, Springer-Verlag, Berlin, New York, Tokyo, 1991.Google Scholar