The degree of regularity of HFE systems

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

Volumn 6477 LNCS, Issue , 2010, Pages 557-576

  Dubois, Vivien ^a   Gama, Nicolas ^b  

^a DGA MI   (France)

^b EPFL   (Switzerland)

Author keywords

algebraic cryptanalysis; HFE; multivariate polynomials

Indexed keywords

ALGEBRA; CRYPTOGRAPHY; SECURITY OF DATA;

ALGEBRAIC CRYPTANALYSIS; ALGEBRAIC STRUCTURES; ARBITRARY VECTORS; MULTIVARIATE POLYNOMIAL; OVERDETERMINED SYSTEMS; PUBLIC KEY SCHEMES; PUBLIC SYSTEMS; RANDOM SYSTEMS;

COMPUTATION THEORY;

EID: 78650844194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17373-8_32     Document Type: Conference Paper

References (19)

1. Bardet, M.: Étude des systémes algébriques surdéterminés. Applications aux codes correcteurs et ála cryptographie. PhD thesis, UniversitéParis 6 (2004)
2. Bardet, M., Faugére, J.-C., Salvy, B.: On the Complexity of Gröbner Basis Computation of Semi-Regular Overdetermined Algebraic Equations. In: ICPSS International Conference on Polynomial System Solving (2004)
3. Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassnringes nach einem nulldimensionalen Polynomideal. PhD thesis, Innsbruck (1965)
4. Courtois, N.: The Security of Hidden Field Equations (HFE). In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 266-281. Springer, Heidelberg (2001)
5. 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)
6. Diem, C.: The xl-algorithm and a conjecture from commutative algebra. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 323-337. Springer, Heidelberg (2004)
7. Ding, J., Schmidt, D., Werner, F.: Algebraic attack on hfe revisited. In: Wu, T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol. 5222, pp. 215-227. Springer, Heidelberg (2008)
8. Dubois, V., Granboulan, L., Stern, J.: An Efficient Provable Distinguisher for HFE. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 156-167. Springer, Heidelberg (2006)
9. 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)
10. Faugére, J.-C.: A New Efficient Algorithm for Computing Gröbner Bases (F4). Journal of Pure and Applied Algebra 139, 61-88 (1999)
11. Faugére, J.-C.: A New Efficient Algorithm for Computing Gröbner Bases without Reductions to Zero F5. In: ISSAC, pp. 75-83 (2002)
12. Faugére, J.-C.: Algebraic Cryptanalysis of HFE using Gröbner Bases. Technical Report 4738, INRIA (2003)
13. Kunz-Jacques, S.: Preuves de sécurité et problémes difficiles en cryptologie: étude de cas. PhD thesis, Université Paris 7 (2007)
14. Lazard, D.: Gröbner-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)
15. 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)
16. 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)
17. Steel, A.: Allan Steel's Groebner Basis Timings Page (2004), magma.maths.usyd.edu.au/users/allan/gb
18. University of Sydney Computational Algebra Group. The MAGMA Computational Algebra System
19. Yang, B.-Y., Chen, J.-M.: All in the xl family: Theory and practice. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 67-86. Springer, Heidelberg (2005)