Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2010, Pages 257-264

  Faugère, Jean Charles ^a   Safey El Din, Mohab ^a   Spaenlehauer, Pierre Jean ^a  

^a INRIA   (France)

Author keywords

Bner bases; Degree of regularity; Determinantal ideals; Generalized nonlinear eigenvalue problem; Gr ; Multi homogeneous ideals; Multivariate cryptography; Polynomial systems solving

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DEFECTS; EIGENVALUES AND EIGENFUNCTIONS; POLYNOMIAL APPROXIMATION;

BNER BASES; DEGREE OF REGULARITY; DETERMINANTAL IDEALS; MULTI-HOMOGENEOUS IDEALS; MULTIVARIATE CRYPTOGRAPHY; NONLINEAR EIGENVALUE PROBLEM; POLYNOMIAL SYSTEMS;

MATRIX ALGEBRA;

EID: 77956272212     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1837934.1837984     Document Type: Conference Paper

References (21)

1. B. Bank, M. Giusti, J. Heintz, M. Safey El Din, and E. Schost. On the geometry of polar varieties. Applicable Algebra in Engineering, Communication and Computing, 21(1): 33-83, 2010.
2. M. Bardet, J.-C. Faugère, and 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, pages 71-74, 2004.
3. M. Bardet, J.-C. Faugère, B. Salvy, and B. Yang. Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In Proceedings of MEGA, 2005.
4. W. Bruns and U. Vetter. Determinantal rings. Springer, 1988.
5. J. Buss, G. Frandsen, and J. Shallit. The computational complexity of some problems of linear algebra. Journal of Computer and System Sciences, 58(3): 572-596, 1999.
6. A. Conca and J. Herzog. On the Hilbert function of determinantal rings and their canonical module. Proceedings of the American Mathematical Society, pages 677-681, 1994.
7. N. Courtois. Efficient zero-knowledge authentication based on a linear algebra problem MinRank. In Advances in Cryptology-Asiacrypt 2001, volume 2248 of LNCS, pages 402-421. Springer.
8. D. Cox, J. Little, and D. O'Shea. Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer, 1997.
9. D. Eisenbud. Commutative algebra with a view toward algebraic geometry. Springer, 2004.
10. I. Emiris and J. Canny. Efficient incremental algorithms for the sparse resultant and the mixed volume. Journal of Symbolic Computation, 20(2): 117-149, 1995.
11. J.-C. Faugère. A new efficient algorithm for computing Gröbner bases (F4). Journal of Pure and Applied Algebra, 139(1-3): 61-88, 1999.
12. J.-C. Faugère. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pages 75-83. ACM, 2002.
13. 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): 329-344, 1993.
14. J.-C. Faugère, F. Levy-dit Vehel, and L. Perret. Cryptanalysis of MinRank. In Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology, page 296. Springer, 2008.
15. J.-C. Faugère, M. Safey El Din, and P-J. Spaenlehauer. Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity. arXiv:1001.4004v1 [cs.SC], 2010.
16. H. Flenner, L. van Gastel, and W. Vogel. Joins and intersections. Springer, 1991.
17. R. Fröberg. An inequality for Hubert series of graded algebras. Math. Scand., 56(2): 117-144, 1985.
18. W. Fulton. Intersection theory. Springer, 1984.
19. A. Kipnis and A. Shamir. Cryptanalysis of the HFE public key cryptosystem by relinearization. In Advances in Cryptology-CRYPTO' 99, volume 1666 of LNCS, pages 19-30. Springer, 1999.
20. D. Lazard. Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. In Computer Algebra, EUROCAL'83, volume 162 of LNCS, pages 146-156. Springer, 1983.
21. A.-V Ourivski and T. Johansson. New technique for decoding codes in the rank metric and its cryptography applications. Problems of Information Transmission, 38(3): 237-246, 2002.