Advanced Encryption Standard (AES) is the most widely used symmetric encryption method today and no attack known to date is effective enough to undermine this cryptosystem. An interesting approach consists in calculating the Gröbner basis of the polynomial system associated with the encryption process. Once calculated, the result obtained is correct and allows to find the clear and the key of encryption. The problem with this method is that it is much too long to calculate on practical cases, which makes it unusable.
The goal of this introspective project of algebraic cryptanalysis on AES is to seek and find ways of improving Gröbner bases to reduce complexity.
See /documentation
There is a PDF report of my work (in french) summing up everything i did.
See /python and /notebooks
graph files of interesting results are in /graph_files and my GEPHI project is available as a project file graph_files/graphs.gephi