On the complexity of solving quadratic Boolean systems

Journal of Complexity

Volumn 29, Issue 1, 2013, Pages 53-75

  Bardet, Magali ^a   Faugère, Jean Charles ^b,c,d   Salvy, Bruno ^b   Spaenlehauer, Pierre Jean ^b,c,d  

^a UNIVERSITÉ DE ROUEN   (France)

^b INRIA   (France)

^c CNRS   (France)

^d SORBONNE UNIVERSITÉ   (France)

Author keywords

Boolean quadratic system; Complexity; Gr bner bases; Multivariate cryptography; Semi regularity

Indexed keywords

BOOLEAN FUNCTIONS; CRYPTOGRAPHY; LINEAR ALGEBRA;

COMPLEXITY; CRYPTOGRAPHIC APPLICATIONS; EXPECTED COMPLEXITY; MULTIVARIATE CRYPTOGRAPHY; PROBABILISTIC VARIANT; QUADRATIC POLYNOMIAL; QUADRATIC SYSTEMS; SEMI-REGULARITY;

COMPUTATIONAL COMPLEXITY;

EID: 84870383684     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2012.07.001     Document Type: Article

References (42)

1. M. Albrecht, J.-C. Faugère, P. Farshim, and L. Perret Polly cracker, revisited Advances in Cryptology - Asiacrypt 2011 Lecture Notes in Computer Science vol. 7073 2011 Springer-Verlag 179 196
2. G. Ars, J.-C. Faugère, H. Imai, M. Kawazoe, and M. Sugita Comparison between XL and Gröbner basis algorithms Advances in Cryptology - AsiaCrypt 2004 Lecture Notes in Computer Science vol. 3329 2004 338 353
3. M. Bardet, Étude des systèmes algébriques surdéterminés. Applications aux codes et à la cryptographie, Ph.D. Thesis, Université Paris 6, 2004.
4. M. Bardet, J.-C. Faugère, B. Salvy, On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations, in: Proceedings of the International Conference on Polynomial System Solving, ISCPP, 2004, pp. 71-74.
5. M. Bardet, J.-C. Faugère, B. Salvy, and B.-Y. Yang Asymptotic expansion of the degree of regularity for semi-regular systems of equations Effective Methods in Algebraic Geometry MEGA 2005 1 14
6. C. Berbain, H. Gilbert, and J. Patarin QUAD: a practical stream cipher with provable security S. Vaudenay, Advances in Cryptology - Eurocrypt 2006 Lecture Notes in Computer Science vol. 4004 2006 Springer 109 128 (Pubitemid 44072236)
7. C. Berbain, H. Gilbert, and J. Patarin QUAD: a multivariate stream cipher with provable security Journal of Symbolic Computation 44 2009 1703 1723
8. L. Bettale, J.-C. Faugère, and L. Perret Hybrid approach for solving multivariate systems over finite fields Journal of Mathematical Cryptology 3 2009 177 197
9. L. Bettale, J.-C. Faugère, L. Perret, Solving polynomial systems over finite fields: improved analysis of the hybrid approach, in: ISSAC'12: Proceedings of the 2012 International Symposium on Symbolic and Algebraic Computation, 2012, pp. 67-74.
10. 2 Cryptographic Hardware and Embedded Systems CHES 2010 Lecture Notes in Computer Science vol. 6225 2010 203 218
11. B. Buchberger, An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, Ph.D. Thesis, University of Innsbruck, 1965.
12. J.F. Canny, E. Kaltofen, and L. Yagati Solving systems of nonlinear polynomial equations faster ISSAC'89: Proceedings of the 1989 International Symposium on Symbolic and Algebraic Computation 1989 ACM Press 121 128
13. D. Coppersmith, and S. Winograd Matrix multiplication via arithmetic progressions Journal of Symbolic Computation 9 3 1990 251 280
14. D. Cox, J. Little, and D. O'Shea Ideals, Varieties and Algorithms third ed. 1997 Springer
15. D. Eisenbud Commutative Algebra with a View Toward Algebraic Geometry 1995 Springer
16. J.-C. Faugère A new efficient algorithm for computing Gröbner bases (F4) Journal of Pure and Applied Algebra 139 1-3 1999 61 88
17. J.-C. Faugère A new efficient algorithm for computing Gröbner bases without reductions to zero (F5) T. Mora, ISSAC'02: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation 2002 ACM Press 75 83 (Pubitemid 35023374)
18. J.-C. Faugère, P. Gianni, D. Lazard, and T. Mora Efficient computation of zero-dimensional Gröbner bases by change of ordering Journal of Symbolic Computation 16 4 1993 329 344
19. J.-C. Faugère, and A. Joux Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases Advances in Cryptology - Crypto 2003 Lecture Notes in Computer Science vol. 2729 2003 Springer 44 60 (Pubitemid 137636934)
20. J.-C. Faugère, A. Otmani, L. Perret, and J.-P. Tillich Algebraic cryptanalysis of McEliece variants with compact keys Advances in Cryptology - Eurocrypt 2010 Lecture Notes in Computer Science vol. 6110 2010 Springer-Verlag 279 298
21. S.D. Fisher, and M.N. Alexander Matrices over a finite field The American Mathematical Monthly 73 6 1966 639 641
22. A.S. Fraenkel, and Y. Yesha Complexity of problems in games, graphs and algebraic equations Discrete Applied Mathematics 1 1-2 1979 15 30
23. R. Fröberg An inequality for Hilbert series of graded algebras Mathematica Scandinavica 56 1985 117 144
24. G. Fusco, and E. Bach Phase transition of multivariate polynomial systems Theory and Applications of Models of Computation TAMC Lecture Notes in Computer Science vol. 4484 2007 632 645 (Pubitemid 47619244)
25. M. Giesbrecht, A. Lobo, and B.D. Saunders Certifying inconsistency of sparse linear systems ISSAC'98: Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation 1998 ACM Press 113 119
26. Z. Jelonek On the effective Nullstellensatz Inventiones Mathematicae 162 1 2005 1 17 (Pubitemid 41312595)
27. E. Kaltofen, and B.D. Saunders On Wiedemann's method of solving sparse linear systems Applied Algebra, Algebraic Algorithms and Error-Correcting Codes Lecture Notes in Computer Science vol. 539 1991 Springer 29 38
28. A. Kipnis, J. Patarin, and L. Goubin Unbalanced oil and vinegar signature schemes Advances in Cryptology - Eurocrypt'99 Lecture Notes in Computer Science vol. 1592 1999 206 222
29. A. Kipnis, and A. Shamir Cryptanalysis of the HFE public key cryptosystem by relinearization Advances in Cryptology - Crypto'99 Lecture Notes in Computer Science vol. 1666 1999 Springer 19 30
30. F.S. Macaulay On some formulæ in elimination Proceedings of the London Mathematical Society 33 1 1902 3 27
31. G. Moreno-Socías Degrevlex Gröbner bases of generic complete intersections Journal of Pure and Applied Algebra 180 3 2003 263 283 (Pubitemid 36379669)
32. J. Patarin Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms Advances in Cryptology - Eurocrypt'96 Lecture Notes in Computer Science vol. 1070 1996 Springer 33 48 (Pubitemid 126071052)
33. I. Semaev On solving sparse algebraic equations over finite fields Designs, Codes and Cryptography 49 1-3 2008 47 60
34. I. Semaev Sparse algebraic equations over finite fields SIAM Journal on Computing 39 2 2009 388 409
35. E.L. Stitzinger The probability that a linear system is consistent Linear and Multilinear Algebra 21 4 1987 367 371
36. A. Storjohann, Algorithms for matrix canonical forms, Ph.D. Thesis, Department of Computer Science, ETH, Zürich, 2000.
37. A. Stothers, On the complexity of matrix multiplication, Ph.D. Thesis, University of Edinburgh, 2010.
38. V. Vassilevska Williams, Breaking the Coppersmith-Winograd barrier, Tech. Rep., 2011.
39. G. Villard Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems ISSAC'97: Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation 1997 ACM Press 32 39
40. D. Wiedemann Solving sparse linear equations over finite fields IEEE Transactions on Information Theory 32 1 1986 54 62 (Pubitemid 16595643)
41. B.-Y. Yang, and J.-M. Chen Theoretical analysis of XL over small fields Information Security and Privacy 2004 Lecture Notes in Computer Science vol. 3108 2004 277 288
42. B.-Y. Yang, J.-M. Chen, and N.T. Courtois On asymptotic security estimates in XL and Gröbner bases-related algebraic cryptanalysis ICICS 2004 Lecture Notes in Computer Science vol. 3269 2004 Springer-Verlag 401 413 (Pubitemid 39737154)