The security of hidden field equations (HFE)

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

Volumn 2020, Issue , 2001, Pages 266-281

  Courtois, Nicolas T ^a  

^a UNIVERSITÉ DE TOULON   (France)

Author keywords

Asymmetric cryptography; Basic HFE; Finite fields; HFE problem; Hidden field equation; MinRank problem; One way functions; Short signature

Indexed keywords

POLYNOMIAL APPROXIMATION;

ASYMMETRIC CRYPTOGRAPHY; BASIC HFE; FINITE FIELDS; HFE PROBLEM; HIDDEN FIELD EQUATIONS; MINRANK PROBLEM; ONE-WAY FUNCTIONS; SHORT SIGNATURES;

CRYPTOGRAPHY;

EID: 84937560136     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45353-9_20     Document Type: Conference Paper

References (24)

1. Don Coppersmith, Jacques Stern, Serge Vaudenay: Attacks on the birational permutation signature schemes; CRYPTO 93, Springer-Verlag, pp. 435-443.
2. Don Coppersmith, Samuel Winograd: "Matrix multiplication via arithmetic progressions"; J. Symbolic Computation (1990), 9, pp. 251-280.
3. Nicolas Courtois: La sffecuritffe des primitives cryptographiques basffees sur les problffemes algffebriques multivariables MQ, IP, MinRank, et HFE, PhD thesis, Paris 6 University, to appear in 2001, partly in English.
4. Nicolas Courtois: The HFE cryptosystem home page. Describes all aspects of HFE and allows to download an example of HFE challenge. http://www. hfe. minrank. org
5. Nicolas Courtois: The Minrank problem. MinRank, a new Zero-knowledge scheme based on the NP-complete problem. Presented at the rump session of Crypto 2000, available at http://www. minrank. org
6. Michael Garey, David Johnson: Computers and Intractability, a guide to the theory of NP-completeness, Freeman, p. 251.
7. J. von zur Gathen, Victor Shoup, "Computing Fröbenius maps and factoring polynomials", Proceedings of the 24th Annual ACM Symposium in Theory of Computation, ACM Press, 1992.
8. Neal Koblitz: "Algebraic aspects of cryptography"; Springer-Verlag, ACM3, 1998, Chapter 4: "Hidden Monomial Cryptosystems", pp. 80-102
9. Tsutomu Matsumoto, Hideki Imai: "Public Quadratic Polynomial-tuples for effficient signature-verification and message-encryption", Eurocrypt'88, Springer-Verlag 1998, pp. 419-453.
10. Tsutomu Matsumoto, Hideki Imai:"A class of asymmetric cryptosystems based on polynomials over finite rings"; 1983 IEEE International Symposium on Information Theory, Abstract of Papers, pp. 131-132, September 1983.
11. http://www. minrank. org, a non-profit web site dedicated to MinRank and Multivariate Cryptography in general.
12. Peter L. Montgomery: A Block Lanczos Algorithm for Finding Dependencies over GF(2); Eurocrypt'95, LNCS, Springer-Verlag.
13. Jacques Patarin: "Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88"; Crypto'95, Springer-Verlag, pp. 248-261.
14. Jacques Patarin: "Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms"; Eurocrypt'96, Springer Verlag, pp. 33-48. The extended version can be found at http://www. minrank. org/_courtois/hfe. ps
15. Jacques Patarin: La Cryptographie Multivariable; Mffemoire d'habilitation à diriger des recherches de l'Universitffe Paris 7, 1999.
16. Jacques Patarin, Nicolas Courtois, Louis Goubin: "C*-+ and HM – Variations around two schemes of T. Matsumoto and H. Imai"; Asiacrypt 1998, Springer-Verlag, pp. 35-49.
17. Jacques Patarin, Aviad Kipnis, Louis Goubin: "Unbalanced Oil and Vinegar Signature Schemes"; Eurocrypt 1999, Springer-Verlag.
18. Jacques Patarin, Louis Goubin: "Asymmetric Cryptography with Multivariate Polynomials over Finite Fields"; a draft with a compilation of various papers and some unpublished work, Bull PTS, ask from authors.
19. Jacques Patarin, Louis Goubin, Nicolas Courtois: Quartz, 128-bit long digital signatures; Cryptographers' Track Rsa Conference 2001, San Francisco 8-12 April 2001, to appear in Springer-Verlag.
20. Jacques Patarin, Louis Goubin, Nicolas Courtois: Flash, a fast multivariate signature algorithm; Cryptographers' Track Rsa Conference 2001, San Francisco 8-12 April 2001, to appear in Springer-Verlag.
21. Adi Shamir, Nicolas Courtois, Jacques Patarin, Alexander Klimov, Efficient Algorithms for solving Overdefined Systems of Multivariate Polynomial Equations, in Advances in Cryptology, Proceedings of EUROCRYPT'2000, LNCS n° 1807, Springer, 2000, pp. 392-407.
22. Adi Shamir, Aviad Kipnis: "Cryptanalysis of the Oil and Vinegar Signature Scheme"; Crypto'98, Springer-Verlag.
23. Adi Shamir, Aviad Kipnis: "Cryptanalysis of the HFE Public Key Cryptosystem"; Crypto'99. Can be found at http://www. minrank. org/_courtois/hfesubreg. ps
24. J. O. Shallit, G. S. Frandsen, J. F. Buss, The computational complexity of some problems of linear algebra, BRICS series report, Aarhus, Denmark, RS-96-33. Available at http://www. brics. dk/RS/96/33