Solving polynomial systems over finite fields: Improved analysis of the hybrid approach

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2012, Pages 67-74

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

^a OBERTHUR TECHNOLOGIES   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC COMPLEXITY; COMPLEXITY ANALYSIS; COMPUTER ALGEBRA; FINITE FIELDS; HYBRID APPROACH; POLYNOMIAL SYSTEM SOLVING; POLYNOMIAL SYSTEMS; QUADRATIC SYSTEMS;

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; CRYPTOGRAPHY; HARDNESS;

POLYNOMIALS;

EID: 84870352997     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2442829.2442843     Document Type: Conference Paper

References (39)

1. M. Albrecht, J.-C. Faugère, P. Farshim, and L. Perret. Polly cracker, revisited. In D. Lee and X. Wang, editors, Advances in Cryptology Asiacrypt 2011, volume 7073 of Lecture Notes in Computer Science, pages 179-196. Springer Berlin/Heidelberg, 2011.
2. G. Ars, J.-C. Faugère, H. Imai, M. Kawazoe, and M. Sugita. Comparison between xl and gröbner basis algorithms. In P. J. Lee, editor, ASIACRYPT, volume 3329 of Lecture Notes in Computer Science, pages 338-353. Springer, 2004.
3. D. Augot, J.-C. Faugère, and L. Perret. Foreword. J. Symb. Comput., 44(12):1605-1607, 2009.
4. M. Bardet. Études des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie. PhD thesis, Université Paris 6, Décembre 2004.
5. M. Bardet, J.-C. Faugère, and B. Salvy. Complexity study of Gröbner basis computation. Technical report, INRIA, 2002. http://www.inria.fr/rrrt/rr-5049.html.
6. M. Bardet, J.-C. Faugère, and B. Salvy. On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations. In International Conference on Polynomial System Solving - ICPSS, pages 71-75, 2004.
7. M. Bardet, J.-C. Faugère, B. Salvy, and P.-J. Spaenlehauer. On the complexity of solving quadratic boolean systems. CoRR, abs/1112.6263, 2011.
8. M. Bardet, J.-C. Faugère, B. Salvy, and B.-Y. Yang. Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In The Effective Methods in Algebraic Geometry Conference - MEGA 2005, pages 1-14, 2005.
9. L. Bettale, J.-C. Faugère, and L. Perret. Hybrid approach for solving multivariate systems over finite fields. Journal of Mathematical Cryptology, volume 3(issue 3):177-197, 2009.
10. C. Bouillaguet, H.-C. Chen, C.-M. Cheng, T. Chou, R. Niederhagen, A. Shamir, and B.-Y. Yang. Fast exhaustive search for polynomial systems in f2. In S. Mangard and F.-X. Standaert, editors, CHES, volume 6225 of Lecture Notes in Computer Science, pages 203-218. Springer, 2010.
11. B. Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, University of Innsbruck, 1965.
12. B. Buchberger. Bruno buchberger's phd thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Journal of Symbolic Computation, 41(3-4):475-511, 2006.
13. B. Buchberger, G. E. Collins, R. G. K. Loos, and R. Albrecht. Computer algebra symbolic and algebraic computation. SIGSAMBull., 16(4):5-5, 1982.
14. C. Cid, S. Murphy, and M. J. B. Robshaw. Algebraic aspects ofthe advanced encryption standard. Springer, 2006.
15. N. Courtois, L. Goubin, and J. Patarin. SFLASHv3, a fast asymmetric signature scheme. available at http://eprint.iacr.org/2003/211.
16. N. Courtois and J. Pieprzyk. Cryptanalysis of block ciphers with overdefined systems of equations. In Y. Zheng, editor, ASIACRYPT, volume 2501 of Lecture Notes in Computer Science, pages 267-287. Springer, 2002.
17. N. T. Courtois and G. V. Bard. Algebraic cryptanalysis of the data encryption standard. In Cryptography and Coding '07, volume 4887 of Lecture Notes in Computer Science, pages 152-169. Springer, 2007.
18. I. Dinur and A. Shamir. Cube attacks on tweakable black box polynomials. In A. Joux, editor, EUROCRYPT, volume 5479 of Lecture Notes in Computer Science, pages 278-299. Springer, 2009.
19. J.-C. Faugère. A new efficient algorithm for computing Gröbner bases (F4). Journal of Pure and Applied Algebra, 139:61-88, June 1999.
20. J.-C. Faugère. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation ISSAC, pages 75-83. ACM Press, 2002.
21. J.-C. Faugère, F. L. dit Vehel, and L. Perret. Cryptanalysis of minrank. In D. Wagner, editor, CRYPTO, volume 5157 of Lecture Notes in Computer Science, pages 280-296. Springer, 2008.
22. J.-C. Faugère, P. M. Gianni, D. Lazard, and T. Mora. Efficient computation of zero-dimensional gröbner bases by change of ordering. J. Symb. Comput., 16(4):329-344, 1993.
23. J.-C. Faugère and A. Joux. Algebraic cryptanalysis of Hidden Field Equation (HFE) cryptosystems using Gröbner bases. In Advances in Cryptology - CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 44-60. Springer, 2003.
24. J.-C. Faugère, A. Otmani, L. Perret, and J.-P. Tillich. Algebraic cryptanalysis of mceliece variants with compact keys. In Advances in Cryptology - EUROCRYPT 2010, volume 6110 of Lecture Notes in Computer Science, pages 279-298. Springer, 2010.
25. J.-C. Faugère, L. Perret, C. Petit, and G. Renault. Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Field. In Proceedings of Eurocrypt 2012, Lecture Notes in Computer Science, pages 1-15. Springer Verlag, 2012.
26. R. Fröberg. An inequality for Hilbert series of graded algebras. Math. Scand., 56(2):117-144, 1985.
27. S. Gao, Y. Guan, and F. Volny. A new incremental algorithm for computing groebner bases. In W. Koepf, editor, ISSAC, pages 13-19. ACM, 2010.
28. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
29. A. Kipnis, J. Patarin, and L. Goubin. Unbalanced oil and vinegar signature schemes. In Advances in Cryptology -EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 206-222. Springer, 1999.
30. A. Kipnis and A. Shamir. Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization. In Advances in Cryptology - CRYPTO 99, volume 1666 of Lecture Notes in Computer Science, pages 19-30. Springer, 1999.
31. A. Kipnis and A. Shamir. Cryptanalysis of the hfe public key cryptosystem by relinearization. In M. J. Wiener, editor, CRYPTO, volume 1666 of Lecture Notes in Computer Science, pages 19-30. Springer, 1999.
32. T. Matsumoto and H. Imai. Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. In Advances in Cryptology -EUROCRYPT '88, volume 330 of Lecture Notes in Computer Science, pages 419-453. Springer, 1988.
33. J. Patarin. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of asymmetric algorithms. In Advances in Cryptology - EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pages 33-48. Springer, 1996.
34. K. Sakumoto, T. Shirai, and H. Hiwatari. Public-key identification schemes based on multivariate quadratic polynomials. In P. Rogaway, editor, CRYPTO, volume 6841 of Lecture Notes in Computer Science, pages 706-723. Springer, 2011.
35. M. Sala, T. Mora, L. Perret, S. Sakata, and C. Traverso. Gröbner Bases, Coding, and Cryptography. Springer, 2009.
36. M. Sugita, M. Kawazoe, L. Perret, and H. Imai. Algebraic cryptanalysis of 58-round SHA-1. In Fast Software Encryption, volume 4593 of Lecture Notes in Computer Science, pages 349-365. Springer, 2007.
37. 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/.
38. B.-Y. Yang and J.-M. Chen. Theoretical analysis of xl over small fields. In H. Wang, J. Pieprzyk, and V. Varadharajan, editors, ACISP, volume 3108 of Lecture Notes in Computer Science, pages 277-288. Springer, 2004.
39. B.-Y. Yang, J.-M. Chen, and N. Courtois. On asymptotic security estimates in xl and gröbner bases-related algebraic cryptanalysis. In J. Lopez, S. Qing, and E. Okamoto, editors, ICICS, volume 3269 of Lecture Notes in Computer Science, pages 401-413. Springer, 2004.