A variant of the F4 algorithm

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

Volumn 6558 LNCS, Issue , 2011, Pages 356-375

  Joux, Antoine ^a,b   Vitse, Vanessa ^b  

^a Expertise in electroMagnetism and Computation EMC laboratory   (France)

^b UNIVERSITY OF VERSAILLES   (France)

Author keywords

algebraic cryptanalysis; bner basis; bner trace; F4; F5; Gr ; multivariate cryptography

Indexed keywords

HEURISTIC ALGORITHMS; POLYNOMIALS;

ALGEBRAIC ATTACK; ALGEBRAIC CRYPTANALYSIS; BNER BASIS; BNER TRACE; HIGH PROBABILITY; ITS EFFICIENCIES; MULTIVARIATE CRYPTOGRAPHY; POLYNOMIAL SYSTEMS;

CRYPTOGRAPHY;

EID: 79951788742     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19074-2_23     Document Type: Conference Paper

References (30)

1. Augot, D., Bardet, M., Faug̀ere, J.-C.: On the decoding of binary cyclic codes with the Newton identities. J. Symbolic Comput. 44(12), 1608-1625 (2009)
2. Bard, G.: Algebraic Cryptanalysis, 1st edn. Springer, New York (2009)
3. Bardet, M., Faug̀ere, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. Presented at MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry (2005)
4. Bettale, L., Faug̀ere, J.-C., Perret, L.: Hybrid approach for solving multivariate systems over finite fields. Journal of Mathematical Cryptology, 177-197 (2009)
5. Bosma, W., Cannon, J.J., Playoust, C.: The Magma algebra system I: The user language. J. Symb. Comput. 24(3/4), 235-265 (1997) (Pubitemid 127167874)
6. Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restk-lassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, University of Innsbruck, Austria (1965)
7. Buchberger, B.: A criterion for detecting unnecessary reductions in the construction of Gr̈obner bases. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol. 72, pp. 3-21. Springer, Heidelberg (1979)
8. Buchberger, B.: Gr̈obner bases: An algorithmic method in polynomial ideal theory. In: Bose, N. (ed.) Multidimensional systems theory, Progress, directions and open problems, Math. Appl., vol. 16, pp. 184-232. D. Reidel Publ. Co., Dordrecht (1985)
9. Courtois, N.: Efficient zero-knowledge authentication based on a linear algebra problem MinRank. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 402-421. Springer, Heidelberg (2001) (Pubitemid 33371198)
10. Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392-407. Springer, Heidelberg (2000)
11. Diem, C.: On the discrete logarithm problem in elliptic curves. Preprint (2009), http://www.math.uni-leipzig.de/∼diem/preprints/dlp-ell-curves.pdf
12. Ebert, G.L.: Some comments on the modular approach to Gr̈obner-bases. SIGSAM Bull. 17(2), 28-32 (1983)
13. Eder, C., Perry, J.: F5C: a variant of Faug̀ere's F5 algorithm with reduced Gr̈obner bases arXiv/0906.2967 (2009)
14. Faug̀ere, J.-C.: A new efficient algorithm for computing Gr̈obner bases (F4). Journal of Pure and Applied Algebra 139(1-3), 61-88 (1999)
15. Faug̀ere, J.-C.: A new efficient algorithm for computing Gr̈obner bases without reduction to zero (F5). In: Proceedings of ISSAC 2002. ACM, New York (2002)
16. Faug̀ere, J.-C., Joux, A.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using gr̈obner bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 44-60. Springer, Heidelberg (2003) (Pubitemid 137636934)
17. Faug̀ere, J.-C., Levy-dit-Vehel, F., Perret, L.: Cryptanalysis of MinRank. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 280-296. Springer, Heidelberg (2008)
18. Gaudry, P.: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. J. Symbolic Computation (2008), doi:10.1016/j.jsc.2008.08.005
19. Gebauer, R., M̈oller, H.M.: On an installation of Buchberger's algorithm. J. Symbolic Comput. 6(2-3), 275-286 (1988)
20. q5). Cryp-tology ePrint Archive, Report 2010/157 (2010)
21. Katsura, S., Fukuda, W., Inawashiro, S., Fujiki, N.M., Gebauer, R.: Distribution of effective field in the Ising spin glass of the ±J model at T = 0. Cell Biochem. Biophys. 11(1), 309-319 (1987)
22. Kipnis, A., Patarin, J., Goubin, L.: Unbalanced oil and vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 206-222. Springer, Heidelberg (1999)
23. Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 19-30. Springer, Heidelberg (1999)
24. Lazard, D.: Gr̈obner bases, Gaussian elimination and resolution of systems of algebraic equations. In: Van Hulzen, J.A. (ed.) ISSAC 1983 and EUROCAL 1983. LNCS, vol. 162, pp. 146-156. Springer, Heidelberg (1983)
25. Macaulay, F.: Some formulae in elimination. In: Proceedings of London Mathematical Society, pp. 3-38 (1902)
26. Mohamed, M.S.E., Mohamed, W.S.A.E., Ding, J., Buchmann, J.: MXL2: Solving polynomial equations over GF(2) using an improved mutant strategy. In: Buch-mann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 203-215. Springer, Heidelberg (2008)
27. Sasaki, T., Takeshima, T.: A modular method for Gr̈obner-basis construction over Q and solving system of algebraic equations. J. Inf. Process. 12(4), 371-379 (1989) (Pubitemid 20696768)
28. Semaev, I.: Summation polynomials and the discrete logarithm problem on elliptic curves. Cryptology ePrint Archive, Report 2004/031 (2004)
29. Traverso, C.: Gr̈obner trace algorithms. In: Gianni, P. (ed.) ISSAC 1988. LNCS, vol. 358, pp. 125-138. Springer, Heidelberg (1989)
30. Weispfenning, V.: Comprehensive Gr̈obner bases. J. Symbolic Comput. 14(1), 1-29 (1992)