Solving Structured Polynomial Systems and Applications to Cryptology - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Solving Structured Polynomial Systems and Applications to Cryptology

Jean-Charles Faugère

Résumé

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.

Dates et versions

hal-01298879 , version 1 (06-04-2016)

Identifiants

Citer

Jean-Charles Faugère. Solving Structured Polynomial Systems and Applications to Cryptology. Computer Algebra in Scientific Computing - CASC'09, Sep 2009, Kobe, Japan. pp.79-80, ⟨10.1007/978-3-642-04103-7_7⟩. ⟨hal-01298879⟩
72 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More