Hacking of the AES with Boolean Functions
Michel Dubois, Eric Filiol

TL;DR
This paper explores a novel algebraic approach to cryptanalysis of AES using Boolean functions and their algebraic normal forms, aiming to develop new equations systems for potential cryptanalytic techniques.
Contribution
It introduces a new method of representing AES as Boolean functions and deriving algebraic normal forms to facilitate cryptanalysis.
Findings
Derived algebraic normal forms of AES Boolean functions
Proposed a new equations system for cryptanalysis
Facilitated combinatorial analysis of AES structure
Abstract
One of the major issues of cryptography is the cryptanalysis of cipher algorithms. Cryptanalysis is the study of methods for obtaining the meaning of encrypted information, without access to the secret information that is normally required. 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 with , characterized by its truth table. The arguments of Boolean functions are binary words of length . Any Boolean function can be represented, uniquely, by its algebraic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cryptographic Implementations and Security
