Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Grobner Bases

Antoine Joux Jean-Charles Faugère 1
1 CALFOR - Calcul formel
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this paper, we review and explain the existing algebraic cryptanalysis of multivariate cryptosystems from the hidden field equation (HFE) family. These cryptanalysis break cryptosystems in the HFE family by solving multivariate systems of equations. In this paper we present a new and efficient attack of this cryptosystem based on fast algorithms for computing Gröbner basis. In particular it was was possible to break the first HFE challenge (80 bits) in only two days of CPU time by using the new algorithm F5 implemented in C. From a theoretical point of view we study the algebraic properties of the equations produced by instance of the HFE cryptosystems and show why they yield systems of equations easier to solve than random systems of quadratic equations of the same sizes. Moreover we are able to bound the maximal degree occuring in the Gröbner basis computation. As a consequence, we gain a deeper understanding of the algebraic cryptanalysis against these cryptosystems. We use this understanding to devise a specific algorithm based on sparse linear algebra. In general, we conclude that the cryptanalysis of HFE can be performed in polynomial time. We also revisit the security estimates for existing schemes in the HFE family.
Document type :
Conference papers
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Friday, June 2, 2017 - 11:18:35 AM
Last modification on : Thursday, March 21, 2019 - 2:43:09 PM

Links full text



Antoine Joux, Jean-Charles Faugère. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Grobner Bases. CRYPTO 2003 - 23rd Annual International Cryptology Conference, Aug 2003, Santa Barbara, California, United States. pp.44-60, ⟨10.1007/978-3-540-45146-4_3⟩. ⟨hal-01531947⟩



Record views