Cryptanalysis of MinRank

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

Volumn 5157 LNCS, Issue , 2008, Pages 280-296

  Faugère, Jean Charles ^a   Levy Dit Vehel, Françoise ^b   Perret, Ludovic ^a  

^a INRIA   (France)

^b ENSTA PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC SYSTEMS; CRYPTOLOGY; HOMOGENEOUS STRUCTURES; MULTIVARIATE CRYPTOGRAPHY;

CHLORINE COMPOUNDS; SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 51849145057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85174-5_16     Document Type: Conference Paper

References (27)

1. Adams, W.W., Loustaunau, P.: An Introduction to Gröbner Bases. Graduate Studies in Mathematics 3 (1994)
2. Bardet, M.: Étude des Systèmes Algébriques Surdéterminés. Applications aux Codes Correcteurs et à la Cryptographie. Thèse de doctorat, Université de Paris VI (2004)
3. Bardet, M., Faugère, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems. In: Proc. of MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry (2005)
4. Bardet, M., Faugère, J.-C., Salvy, B.: On the Complexity of Gröbner Basis Computation of Semi-Regular Overdetermined Algebraic Equations. In: Proc. International Conference on Polynomial System Solving (ICPSS), pp. 71-75 (2004), http://www-calfor.lip6.fr/ICPSS/papers/43BF/43BF.htm
5. Buchberger, B., Collins, G.-E., Loos, R.: Computer Algebra Symbolic and Algebraic Computation, 2nd edn. Springer, Heidelberg (1982)
6. Buchberger, B.: Gröbner Bases : an Algorithmic Method in Polynomial Ideal Theory. Recent trends in multidimensional systems theory. Reider ed. Bose (1985)
7. Courtois, N.: Decoding Linear and Rank-Distance Codes, MinRank problem and Multivariate Cryptanalysis. In: CLC 2006, Darmstadt (September 2006)
8. 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)
9. Courtois, N., Goubin, L.: Cryptanalysis of the TTM Cryptosystem. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 44-57. Springer, Heidelberg (2000)
10. Cox, D.A., Little, J.B., O'Shea, D.: Ideals, Varieties, and algorithms: an Introduction to Computational Algebraic Geometry and Commutative algebra. Undergraduate Texts in Mathematics. Springer, New York (1992)
11. 4. Journal of Pure and Applied Algebra 139, 61-68 (1999)
12. 5. In: Proceedings of ISSAC, pp. 75-83. ACM press, New York (2002)
13. Faugère, J.-C., Gianni, P., Lazard, D., Mora, T.: Efficient Computation of Zero-Dimensional Gröbner Basis by Change of Ordering. Journal of Symbolic Computation 16(4), 329-344 (1993)
14. Faugère, J.-C., Joux, A.: Algebraic Cryptanalysis of Hidden Field Equations (HFE) Cryptosystems using Gröbner Bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 44-60. Springer, Heidelberg (2003)
15. Faugère, J.-C., Perret, L.: Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 30-47. Springer, Heidelberg (2006)
16. Fouque, P.-A., Macario-Rat, G., Stern, J.: Key Recovery on Hidden Monomial Multivariate Schemes. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 19-30. Springer, Heidelberg (2008)
17. Garey, M.R., Johnson, D.B.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
18. Jiang, X., Ding, J., Hu, L.: Kipnis-Shamir's Attack on HFE Revisited. In: Proc. of Inscrypt 2007 (2007), http://eprint.iacr.org/2007/203
19. 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)
20. Li, T., Lin, Z., Bai, F.: Heuristic Methods for Computing the Minimal Multi-homogeneous Bézout Number. Applied Mathematics and Computation 146, 237-256 (2003)
21. Malajovich, G., Meer, K.: Computing Minimal Multi-homogeneous Bézout Numbers Is Hard. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 244-255. Springer, Heidelberg (2005)
22. Moh, T.: A Public Key System with Signature and Master Key Functions. Communications in Algebra 27(5), 2207-2222 (1999)
23. 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)
24. Safey El Din, M., Trébuchet, P.: Strong bi-homogeneous Bezout theorem and its use in effective real algebraic geometry. INRIA Research Report RR, 46 pages (2006), http://hal.inria.fr/inria-00105204
25. Shafarevich, I.R.: Basic Algebraic Geometry. Springer Study edn. Springer, Berlin (1977)
26. Shallit, J.O., Frandsen, G.S., Buss, J.F.: The Computational Complexity of some Problems of Linear Algebra. BRICS series report, Aarhus, Denmark, RS-96-33, http://www.brics.dk/RS/96/33
27. Ha, H.T., Van Tuyl, A.: The regularity of points in multi-projective spaces. Journal of Pure and Applied Algebra 187(1-3), 153-167 (2004)