An efficient provable distinguisher for HFE

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4052 LNCS, Issue , 2006, Pages 156-167

  Dubois, Vivien ^a   Granboulan, Louis ^a   Stern, Jacques ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Differential cryptanalysis; HFE; Multivariate cryptography

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; NONLINEAR EQUATIONS; POLYNOMIALS; QUADRATIC PROGRAMMING;

DIFFERENTIAL CRYPTANALYSIS; HFE; MULTIVARIATE CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 33746345894     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_14     Document Type: Conference Paper

References (21)

1. A.Kipnis and A.Shamir. Cryptanalysis of the HFE Public Key Cryptosyatem. In Crypto'99, LNCS 1666, pages 19-30. Springer-Verlag, 1999.
2. A.E.Solow A.Nijenhuis and H.S.Wilf. Bijective methods in the theory of finite vector spaces. J. Combin. Theory (A), 37:80-84, 1984.
3. A.Shamir. Efficient signature schemes based on Birational Permutations. In Crypto'93, LNCS 773, pages 1-12. Springer-Verlag, 1994.
4. C.Wolf and B.Preneel. Taxonomy of Public Key Schemes based on the problem of Multivariate Quadratic equations. Cryptology ePrint Archive, Report 2005/077, 2005. http://eprint.iacr.org/.
5. H.Fell and W.Diffie, Analysis of a Public Key Approach based on Polynomial Substitution. In Crypto'85, LNCS 218, pages 340-349. Springer-Verlag, 1985.
6. J-C.Faugère and A.Joux. Algebraic cryptanalysis of Hidden Field Equation (HFE) cryptosystems using Gröbner Bases. In Crypto'03, LNCS 2729, pages 44-60. Springer-Verlag, 2003.
7. J.Ding, A new variant of the Matsumoto-Imai Cryptosystem through Perturbation. In PKC'04, LNCS 2947, pages 305-318. Springer-Verlag, 2004.
8. J.Ding and D.Schmidt. Cryptanalysis of HFEv and Internal Perturbation of HFE. In PKC'05, LNCS 3386, pages 288-301. Springer-Verlag, 2005.
9. J.Goldman and G-C.Rota. The number of subspaces of a vector space. In W.T.Tutte, editor, Recent progress in Combinatorics, pages 75-83. Academic Press, 1969.
10. J.Patarin, Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Euro crypt'88, In Crypio'95, LNCS 963, pages 248-261. Springer-Verlag, 1995.
11. J.Patarin. Hidden Field Equations (HFE) and Isomorphisms of Polynomials (IP): two families of asymetric algorithms. In Eurocrypt'96, LNCS 1070, pages 33-46. Springer-Verlag, 1996.
12. K.E.Morrison. An introduction to q-species. The Electronic Jounral of Combinatorics, 12(R62), 2005.
13. K.Ireland and M.Rosen. A Classical Introduction to Modern Number Theory, chapter 7. Springer-Verlag, second edition, 1998.
14. M.Garey and D.Johnson. Computer and Intractability: A guide to the theory of NP-completeness. Freeman, 1979.
15. N.Courtois. The security of Hidden Field Equations (HFE). In CT-RSA'01, LNCS 2020, pages 266-281. Springer-Verlag, 2001.
16. P-A.Fouque, L.Granboulan, and J.Stern. Differential cryptanalysis for Multivariate Schemes.In Eurocrypt'05, LNCS 3386, pages 341-353. Springer-Verlag, 2005.
17. P.Shor. Polynomial-time algorithms for prime factorzation and discrete logarithms on a quantum computer. SIAM J. Comput., 26(5):1484-1509, 1997.
18. S.Finch. Mathematical Constants, pages 354-361. Cambridge, 2003.
19. T.Matsumoto and H.Irnai. A class of asymetric cryptosystems based on Polynomials over Finite Rings. In ISIT'83, pages 131-132, 1983.
20. T.Matsumoto and H.Imai. Public Quadratic Polynomial-tuples for efficient signature-verification and message encryption. In Eurocrypt'88, LNCS 330, pages 419-453. Springer-Verlag, 1988.
21. V.Dubois, L.Granboulan, and J.Stern. Cryptanalysis of HFE with Internal Perturbation, work in progress, 2006.