On the security of HFE, HFEv- and quartz

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

Volumn 2567, Issue , 2003, Pages 337-350

  Courtois, Nicolas T ^a   Daum, Magnus ^b   Felke, Patrick ^b  

^a CP8 Crypto Lab   (France)

^b RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Asymmetric cryptography; Finite fields; Gr bner bases; HFE problem; Hidden Field Equation; Multivariate crypt analysis; Nessie project; Quartz

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

ASYMMETRIC CRYPTOGRAPHY; FINITE FIELDS; HFE PROBLEM; HIDDEN FIELD EQUATIONS; MULTIVARIATE CRYPTANALYSIS; NESSIE PROJECT;

QUARTZ;

EID: 35248824029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36288-6_25     Document Type: Article

References (29)

1. Boo Barkee, Deh Cac Can, Julia Ecks, Theo Moriarty, R. F. Ree: Why You Cannot Even Hope to use Gröbner Bases in Public Key Cryptography: An Open Letter to a Scientist Who Failed and a Challenge to Those Who Have Not Yet Failed, in Journal of Symbolic Computation 18, 1994, pp. 497-501
2. Dan Boneh, H. Shacham, and B. Lynn: Short signatures from the Weil pairing, Asiacrypt 2001, LNCS 2139, Springer, pp. 514-532.
3. Don Coppersmith, Shmuel Winograd: Matrix multiplication via arithmetic progressions; J. Symbolic Computation (1990), 9, pp. 251-280.
4. David Cox, John Little, Donal O'Shea: Ideals, Varieties, and Algorithms, Springer-Verlag, 1992
5. Francisco Corella: A fast implementation of DES and triple DES on PARISC 2.0. http://www.usenix.org/events/osdi2000/wiess2000/full_papers/corella/corella.pdf
6. Nicolas Courtois, Matthieu Finiasz and Nicolas Sendrier: How to achieve a McEliece-based Digital Signature Scheme; Asiacrypt 2001, LNCS2248, Springer, pp. 157-174. Available at http://www.cryptosystem.net/mceliece/.
7. Nicolas Courtois, Adi Shamir, Jacques Patarin, Alexander Klimov, Efficient Algorithms for solving Overdefined Systems of Multivariate Polynomial Equations, in Advances in Cryptology, Eurocrypt'2000, LNCS 1807, Springer-Verlag, pp. 392-407.
8. Nicolas Courtois: The security of Hidden Field Equations (HFE); Cryptographers' Track RSA Conference 2001, San Francisco 8-12 Avril 2001, LNCS2020, Springer-Verlag, pp. 266-281.
9. Nicolas Courtois: The HFE cryptoSystem home page, http://www.hfe.info
10. Nicolas Courtois: La sécurité des primitives cryptographiques basées sur les problèmes algébriques multivariables MQ, IP, MinRank, et HFE, PhD thesis, Paris 6 University, 2001, in French. Available at http://www.minrank.org/phd.pdf.
11. Nicolas Courtois: Generic Attacks and the Security of Quartz, PKC 2003, in these proceedings. A preliminary version was presented at the second Nessie workshop, Royal Holloway, University of London, September 2001.
12. Magnus Daum, Patrick Felke: Some new aspects concerning the Analysis of HFE type Cryptosystems; Presented at Yet Another Conference on Cryptography (YACC'02), June 3-7, 2002, Porquerolles Island, France.
13. Magnus Daum: Das Kryptosystem HFE und quadratische Gleichungssysteme über endlichen Körpern, Diplomarbeit, Universität Dortmund, 2001. Available from daum@itsc.ruhr-uni-bochum.de
14. 4), Journal of Pure and Applied Algebra 139, 1-3 (1999) pp. 61-88. See www.elsevier.com/locate/jpaa
15. Jean-Charles Faugère: Computing Gröbner basis without reduction to 0, technical report LIP6, in preparation, source: private communication. Also presented at the Workshop on Applications of Commutative Algebra, Catania, Italy, 3-6 April 2002.
16. Jean-Charles Faugère: Report on a successful attack of HFE Challege 1 with Gröbner bases algorithm F5/2, announcement that appeared in sci.crypt news-group on the internet on April 19th 2002.
17. Henri Gilbert, Marine Minier: Cryptanalysis of SFLASH, Eurocrypt 2002, LNCS 2332, pp. 288-298, Springer.
18. G.-M. Greuel, G. Pfister, and H. Schönemann. SINGULAR 2.0.3. A Computer Algebra System for Polynomial Computations. Centre for Computer Algebra, University of Kaiserslautern (2001), www.singular.uni-kl.de.
19. Neal Koblitz: "Algebraic Aspects of Cryptography"; Springer-Verlag, ACM3, 1998, Chapter 4: "Hidden Monomial Cryptosystems", pp. 80-102.
20. Tsutomu Matsumoto, Hideki Imai: "Public Quadratic Polynomial-tuples for efficient signature-verification and message-encryption", Eurocrypt'88, Springer-Verlag 1998, pp. 419-453.
21. Jacques Patarin: "Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88"; Crypto'95, Springer-Verlag, pp. 248-261.
22. 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/hfe.ps
23. Jacques Patarin: La Cryptographie Multivariable;, Mémoire d'habilitation à diriger des recherches de l'Université Paris 7, 1999.
24. 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.
25. Jacques Patarin, Louis Goubin, Nicolas Courtois: Quartz, 128-bit long digital signatures; Cryptographers' Track Rsa Conference 2001, San Francisco 8-12 April 2001, LNCS2020, Springer-Verlag. Note: The Quartz signature scheme has been updated since, see [26].
26. Jacques Patarin, Louis Goubin, Nicolas Courtois: Quartz, 128-b/t long digital signatures; An updated version of Quartz specification available at http://www.cryptosystem.net/quartz/
27. Adi Shamir, Aviad Kipnis: "Cryptanalysis of the HFE Public Key Cryptosystem"; Crypto'99. Can be found at http://www.minrank.org/hfesubreg.ps
28. Volker Strassen: Gaussian Elimination is Not Optimal; Numerische Mathematik, vol 13, pp 354-356, 1969.
29. Nicolas Courtois, Magnus Daum and Patrick Felke: On the Security of HFE, HFEv- and Quartz; Cryptology ePrint Archive, Report 2002/138. Available at http://eprint.iacr.org.