Solving Structured Polynomial Systems and Applications to Cryptology

Authors:
Jean-Charles Faugère
Affiliations:
SALSA Project INRIA, Centre Paris-Rocquencourt, UPMC, Univ Paris 06, LIP6, CNRS, UMR 7606, LIP6, UFR Ingénierie 919, LIP6 Passy Kennedy, Paris Cedex 05 75252
Venue:
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Year:
2009

Citing 6
Cited 1

The Design of Rijndael

The Design of Rijndael
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Cryptanalysis of MinRank

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal

Journal of Symbolic Computation

Boolean Gröbner bases

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

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.