Hybrid approach for solving multivariate systems over finite fields

Journal of Mathematical Cryptology

Volumn 3, Issue 3, 2009, Pages 177-197

  Bettale, Luk ^a   Faugère, Jean Charles ^a   Perret, Ludovic ^a  

^a INRIA   (France)

Author keywords

Gr bner bases; Multivariate cryptography

Indexed keywords

EID: 78049343086     PISSN: 18622976     EISSN: 18622984     Source Type: Journal    
DOI: 10.1515/JMC.2009.009     Document Type: Article

References (36)

1. William W. Adams and Philippe Loustaunau, An Introduction to Gröbner Bases, Graduate Studies in Mahematics 3. AMS, 1994.
2. Gwénolé Ars, Jean-Charles Faugère, Hideki Imai, Mitsuru Kawazoe, and Makoto Sugita, Comparison between XL and Gröbner basis algorithms. ASIACRYPT 2004 (Pil Joong Lee, ed.), LNCS 3329, pp. 338-353. Springer, December 2004.
3. Magali Bardet, Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie, Ph.D. thesis, Université de Paris VI, 2004.
4. Magali Bardet, Jean-Charles Faugère, and Bruno Salvy, On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations. Proc. International Conference on Polynomial System Solving (ICPSS), pp. 71-75, 2004.
5. Luk Bettale, Jean-Charles Faugère, and Ludovic Perret, Cryptanalysis of the TRMS Signature Scheme of PKC'05. Progress in Cryptology -AFRICACRYPT 2008, Lecture Notes in Computer Science 5023, pp. 143-155. Springer, 2008.
6. Luk Bettale, Jean-Charles Faugère, and Ludovic Perret, Security analysis of multivariate polynomials for hashing. Information Security and Cryptology -INSCRYPT 2008, Lecture Notes in Computer Science. Springer, 2008, to appear.
7. Olivier Billet, Matthew J. B. Robshaw, and Thomas Peyrin, On building hash functions from multivariate quadratic equations. ACISP, LNCS 4586, pp. 82-95. Springer, 2007.
8. Andrey Bogdanov, Thomas Eisenbarth, Andy Rupp, and Christopher Wolf, Time-Area Optimized Public-Key Engines: MQ-Cryptosystems as Replacement for Elliptic Curves?. CHES '08: Proceedings of the 10th international workshop on Cryptographic Hardware and Embedded Systems, pp. 45-61. Springer-Verlag, 2008.
9. An Braeken, Christopher Wolf, and Bart Preneel, A Study of the Security of Unbalanced Oil and Vinegar Signature Schemes. Topics in Cryptology -CT-RSA 2005, LNCS 3376, pp. 29-43. Springer, February 2005. (Pubitemid 41231203)
10. Bruno Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph.D. thesis, University of Innsbruck, 1965.
11. Bruno Buchberger, Georges E. Collins, Rudiger G. K. Loos, and Rudolph Albrecht, Computer algebra symbolic and algebraic computation, SIGSAM Bull. 16 (1982), pp. 5-5.
12. Nicolas Courtois, Alexander Klimov, Jacques Patarin, and Adi Shamir, Efficient algorithms for solving overdefined systems of multivariate polynomial equations. Advances in Cryptology -EUROCRYPT 2000, LNCS 1807, pp. 392-407. Springer, 2000.
13. David A. Cox, John B. Little, and Don O'Shea, Ideals, Varieties and Algorithms. Springer, 2005.
14. Jintai Ding and Bo-Yin Yang, Multivariates Polynomials for Hashing, Cryptology ePrint Archive, Report 2007/137, 2007.
15. V Dubois, Pierre-Alain Fouque, Adi Shamir, and Jacques Stern, Practical Cryptanalysis of SFLASH. Advances in Cryptology -CRYPTO'07, 4622, pp. 1-12. Springer, 2007.
16. Jean-Charles Faugère, A new efficient algorithm for computing Gröbner bases (F4), Journal of Pure and Applied Algebra 139 (1999), pp. 61-88.
17. Jean-Charles Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation ISSAC (T. Mora, ed.), pp. 75-83. ACM Press, July 2002, ISBN: 1-58113-484-3. (Pubitemid 35023374)
18. Jean-Charles Faugère, Patrizia M. Gianni, Daniel Lazard, and Teo Mora, Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering, Journal of Symbolic Computation 16 (1993), pp. 329-344.
19. Jean-Charles Faugère and Antoine Joux, Algebraic cryptanalysis of Hidden Field Equation (HFE) cryptosystems using Gröbner bases. Advances in Cryptology -CRYPTO 2003 (Dan Boneh, ed.), LNCS 2729, pp. 44-60. Springer, 2003. (Pubitemid 137636934)
20. Jean-Charles Faugère and Ludovic Perret, On the security of UOV. SCC 08, 2008.
21. Marc Giusti, Some Effectivity Problems in Polynomial Ideal Theory. EUROSAM, Computation, pp. 159-171, 1984.
22. Aviad Kipnis, Jacques Patarin, and Louis Goubin, Unbalanced Oil and Vinegar Signature. Advances in Cryptology -EUROCRYPT 1999, Lecture Notes in Computer Science 1592, pp. 206-222. Springer-Verlag, 1999.
23. N. Koblitz, Algebraic Aspects of Cryptography., Algorithms and Computation in Mathematics 3. Springer-Verlag, 1998.
24. Daniel Lazard, Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations. EUROCAL, pp. 146-156, 1983.
25. Tsutomu Matsumoto and Hideki Imai, Public Quadratic Polynomial-tuples for Efficient Signature-Verification and Message-Encryption. Advances in Cryptology -EUROCRYPT 1988, LNCS 330, pp. 419-453. Springer-Verlag, 1988.
26. Jacques Patarin, The Oil and Vinegar Signature Scheme, presented at the Dagstuhl Workshop on Cryptography, 1997.
27. Jacques Patarin, Nicolas Courtois, and Louis Goubin, QUARTZ, 128-Bit Long Digital Signatures. CT-RSA'01, 2020, pp. 282-297. Springer, 2001.
28. Jacques Patarin, Louis Goubin, and Nicolas Courtois, C* -+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai. Advances in Cryptology -Asiacrypt'98, 1514, pp. 35-49. Springer, 1998. (Pubitemid 128151418)
29. Agnes Szanto, Multivariate subresultants using Jouanolou's resultant matrices, accepted to Journal of Pure and Applied Algebra (2001).
30. Lih-Chung Wang, Feipei Lai Yuh-Hua Hu, Chun-Yen Chou, and Bo-Yin Yang, Tractable Rational Map Signature. PKC 05, 2005.
31. Xiaoyun Wang, Dengguo Feng, Xuejia Lai, and Hongbo Yu, Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD, Cryptology ePrint Archive, Report 2004/199, 2004.
32. Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, and Xiuyuan Yu, Cryptanalysis of the Hash Functions MD4 and RIPEMD. EUROCRYPT (Ronald Cramer, ed.), LNCS 3494, pp. 1-18. Springer, 2005. (Pubitemid 41313943)
33. Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu, Finding Collisions in the Full SHA-1. CRYPTO (Victor Shoup, ed.), LNCS 3621, pp. 17-36. Springer, 2005. (Pubitemid 43902104)
34. Xiaoyun Wang, Hongbo Yu, and Yiqun Lisa Yin, Efficient Collision Search Attacks on SHA-0. CRYPTO (Victor Shoup, ed.), LNCS 3621, pp. 1-16. Springer, 2005.
35. 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/.
36. Bo-Yin Yang, Jiun-Ming Chen, and Nicolas Courtois, On Asymptotic Security Estimates in XL and Gröbner Bases-Related Algebraic Cryptanalysis. ICICS 2004, pp. 401-413, 2004. (Pubitemid 39737154)