Hacking of the AES with Boolean Functions

Michel Dubois, Eric Filiol

Abstract

One of the major issues of cryptography is the cryptanalysis of cipher algorithms. Some mechanisms for breaking codes include differential cryptanalysis, advanced statistics and brute-force. Recent works also attempt to use algebraic tools to reduce the cryptanalysis of a block cipher algorithm to the resolution of a system of quadratic equations describing the ciphering structure. In our study, we will also use algebraic tools but in a new way: by using Boolean functions and their properties. A Boolean function is a function from Fn 2 !F2 with n > 1. The arguments of Boolean functions are binary words of length n. Any Boolean function can be represented, uniquely, by its algebraic normal form which is an equation which only contains additions modulo 2—the XOR function—and multiplications modulo 2—the AND function. Our aim is to describe the AES algorithm as a set of Boolean functions then calculate their algebraic normal forms by using the Moebius transforms. After, we use a specific representation for these equations to facilitate their analysis and particularly to try a combinatorial analysis. Through this approach we obtain a new kind of equations system.

References

  1. Carlet, C. (2010a). Boolean Functions for Cryptography and Error Correcting Codes. Cambridge University Press. Chapter of the monography “Boolean Models and Methods in Mathematics, Computer Science, and Engineering”.
  2. Carlet, C. (2010b). Vectorial Boolean Functions for Cryptography. Cambridge University Press. Chapter of the monography “Boolean Models and Methods in Mathematics, Computer Science, and Engineering”.
  3. CNSS (2012). National information assurance policy on the use of public standards for the secure sharing of information among national security systems. https://www.cnss.gov.
  4. Courtois, N. and Pieprzyk, J. (2002). Cryptanalysis of block ciphers with overdefined systems of equations. Cryptology ePrint Archive, Report 2002/044. https://eprint.iacr.org/2002/044.pdf.
  5. Daemen, J. and Rijmen, V. (1999). AES proposal: Rijndael. http://csrc.nist.gov/archive/aes/rijndael/Rijndaelammended.pdf.
  6. Dubois, M. and Filiol, E. (2011). Proposal for a new equation system modelling of block ciphers. Proceedings of the 2nd IMA Conference on Mathematics in Defence. http://www.ima.org.uk/db/documents/Dubois.pdf.
  7. Dubois, M. and Filiol, E. (2012a). Proposal for a new equation system modelling of block ciphers and application to AES 128. Proceedings of the 11th European Conference on Information Warfare and Security, pages 303-312.
  8. Dubois, M. and Filiol, E. (2012b). Proposal for a new equation system modelling of block ciphers and application to AES 128 - long version. Pioneer Journal of Algebra, Number Theory and its Applications, 4:11- 40.
  9. McCarty, P. (1986). Introduction to Arithmetical Functions. Springer.
  10. Menezes, A., Oorschot, P., and Vanstone, S. (1997). Handbook of Applied Cryptography. CRC Press.
  11. Murphy, S. and Robshaw, M. (2002). Essential algebraic structure within the AES. Advances in Cryptology - CRYPTO 2002, 2442:1-16.
  12. NIST (2001). Advanced encryption standard. http://csrc.nist.gov/publications/fips/fips197/fips197.pdf.
  13. O'Donnel, R. (2014). Analysis of Boolean Functions. Cambridge University Press.
Download


Paper Citation


in Harvard Style

Dubois M. and Filiol E. (2017). Hacking of the AES with Boolean Functions . In Proceedings of the 3rd International Conference on Information Systems Security and Privacy - Volume 1: ForSE, (ICISSP 2017) ISBN 978-989-758-209-7, pages 599-609. DOI: 10.5220/0006091305990609


in Bibtex Style

@conference{forse17,
author={Michel Dubois and Eric Filiol},
title={Hacking of the AES with Boolean Functions},
booktitle={Proceedings of the 3rd International Conference on Information Systems Security and Privacy - Volume 1: ForSE, (ICISSP 2017)},
year={2017},
pages={599-609},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006091305990609},
isbn={978-989-758-209-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Information Systems Security and Privacy - Volume 1: ForSE, (ICISSP 2017)
TI - Hacking of the AES with Boolean Functions
SN - 978-989-758-209-7
AU - Dubois M.
AU - Filiol E.
PY - 2017
SP - 599
EP - 609
DO - 10.5220/0006091305990609