Last fall degree, HFE, and Weil descent attacks on ECDLP

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

Volumn 9215, Issue , 2015, Pages 581-600

  Huang, Ming Deh A ^a   Kosters, Michiel ^b   Yeo, Sze Ling ^c  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

ECDLP; First fall degree; HFE; Last fall degree; Solving equations; Weil descent

Indexed keywords

CRYPTOGRAPHY; POLYNOMIAL APPROXIMATION;

ECDLP; FIRST FALL DEGREE; HFE; LAST FALL DEGREE; SOLVING EQUATIONS; WEIL DESCENTS;

POLYNOMIALS;

EID: 84943622569     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-47989-6_28     Document Type: Conference Paper

References (25)

1. Buchberger, B.: Ein Algorithmus zum Auffffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. thesis, University of Innsbruck (1965)
2. Buchmann, J.A., Ding, J., Mohamed, M.S.E., Mohamed, W.S.A.E.: Mutantxl: solving multivariate polynomial equations for cryptanalysis. In: Handschuh, H., Lucks, S., Preneel, B., Rogaway, P. (eds.) Symmetric Cryptography (Dagstuhl, Germany, 2009). Dagstuhl Seminar Proceedings, vol. 09031. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)
3. Courtois, N.T., Klimov, A.B., 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)
4. Courtois, N.T., Pieprzyk, J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 267–287. Springer, Heidelberg (2002)
5. Courtois, N.T., Patarin, J.: About the XL algorithm over GF(2). In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 141–157. Springer, Heidelberg (2003)
6. Diem, C.: On the discrete logarithm problem in elliptic curves. Compositio Math. 147, 75–104 (2011)
7. Ding, J., Hodges, T.J.: Inverting HFE systems is quasi-polynomial for all fields. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 724–742. Springer, Heidelberg (2011)
8. Faugére, J.-C., Joux, A.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 44–60. Springer, Heidelberg (2003)
9. Faugére, J.C.: A new efficient algorithm for computing Gröbner bases (F4). J. Pure Appl. Algebra 139, 61–88 (1999)
10. Faugére, J.C.: A new efficient algorithm for computing Gröbner bases without reduction to zero F5. In: Proceedings of ISSAC, pp. 75–83. ACM Press (2002)
11. Faugére, J.C., Gianni, P.M., Lazard, D., Mora, T.: Efficient computation of zerodimensional Gröbner bases by change of ordering. J. Symb. Comput. 16(4), 329–344 (1993)
12. Galbraith, S.D., Smart, N.P.: A cryptographic application of Weil descent. In: Walker, M. (ed.) Cryptography and Coding 1999. LNCS, vol. 1746, pp. 191–200. Springer, Heidelberg (1999)
13. von zur Gathen, J., Panario, D.: Factoring polynomials over finite fields: a survey. J. Symbolic Comput. 31(1–2), 3–17 (2001). Computational algebra and number theory, (1996)
14. Gaudry, P.: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. J. Symb. Comput. 44(12), 1690–1702 (2009)
15. Gaudry, P., Hess, F., Smart, N.P.: Constructive and destructive facets of Weil descent on elliptic curves. J. Cryptology 15(1), 19–46 (2002)
16. Granboulan, L., Joux, A., Stern, J.: Inverting HFE is quasipolynomial. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 345–356. Springer, Heidelberg (2006)
17. 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)
18. Kosters, M.: Groups and fields in arithmetic. Ph.D. thesis, Universiteit Leiden (2014)
19. Kosters, M., Yeo, S.L.: Notes on summation polynomials. Preprint (2015). http://arxiv.org/abs/1503.08001
20. Huang, M.-D.A., Kosters, M., Yang, Y., Yeo, S.L.: On the last fall degree of zero-dimensional Weil descent systems. Preprint (2015). http://arxiv.org/abs/1505.02532
21. Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33–48. Springer, Heidelberg (1996)
22. Petit, C.: Bounding HFE with SRA. Preprint (2013). http://www0.cs.ucl.ac.uk/staff/c.petit/files/SRA GB.pdf
23. Petit, C., Quisquater, J.-J.: On polynomial systems arising from a Weil descent. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 451–466. Springer, Heidelberg (2012)
24. Semaev, I.: Summation polynomials and the discrete logarithm problem on elliptic curves. Preprint (2004). https://eprint.iacr.org/2004/031.pdf
25. Seroussi, G.: Compact representation of elliptic curve points over F n2 research contribution to IEEE P1363 (1998)