Solving structured polynomial systems and applications to cryptology (plenary talk)

Abstract

Cryptography is a collection of mathematical techniques used to secure the transmission and storage of information. A fundamental problem in cryptography is to evaluate the security of cryptosystems against the most powerful techniques. To this end, several general methods have been proposed: linear cryptanalysis, differential cryptanalysis, ⋯ Extensively used cryptographic standards - such as AES [1] - are all resistant against linear and differential attacks. In this talk, we will describe another general method - Algebraic Cryptanalysis - which can be used to evaluate the security of such cryptosystems. © 2009 Springer Berlin Heidelberg.