Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices

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

Volumn , Issue , 2011, Pages 115-122

  Faugère, Jean Charles ^a   Mou, Chenqi ^a,b  

^a INRIA ROCQUENCOURT   (France)

^b BEIHANG UNIVERSITY   (China)

Author keywords

bms algorithm; change of ordering; fglm algorithm; Gr bner bases; sparse matrix; wiedemann algorithm; zero dimensional ideals

Indexed keywords

BMS ALGORITHM; CHANGE OF ORDERING; FGLM ALGORITHM; SPARSE MATRICES; WIEDEMANN ALGORITHM; ZERO-DIMENSIONAL IDEAL;

CODES (SYMBOLS); COMPUTER PROGRAMMING; MATRIX ALGEBRA; POLYNOMIALS;

ALGORITHMS;

EID: 79959685370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993886.1993908     Document Type: Conference Paper

References (20)

1. A. Basiri and J.-C. Faugère. Changing the ordering of Gröbner bases with LLL: case of two variables. In Proceedings of ISSAC 2003, pages 23-29. ACM, 2003.
2. E. Becker, T. Mora, M. Marinari, and C. Traverso. The shape of the Shape Lemma. In Proceedings of ISSAC 1994, pages 129-133. ACM, 1994.
3. T. Becker, V. Weispfenning, and H. Kredel. Gröbner Bases: a Computational Approach to Commutative Algebra. Graduate Texts in Mathematics. Springer, New York, 1993.
4. R. P. Brent, F. G. Gustavson, and D. Y. Y. Yun. Fast solution of toeplitz systems of equations and computation of Padé approximants. Journal of Algorithms, 1(3):259-295, 1980.
5. B. Buchberger. Gröbner bases: An algorithmic method in polynomial ideal theory. In Multidimensional Systems Theory, pages 184-232. Reidel, Dordrecht, 1985.
6. J. Buchmann, A. Pyshkin, and R.-P. Weinmann. A zero-dimensional Gröbner basis for AES-128. In M. Robshaw, editor, Fast Software Encryption, volume 4047 of LNCS, pages 78-88. Springer, Berlin / Heidelberg, 2006.
7. S. Collart, M. Kalkbrener, and D. Mall. Converting bases with the Gröbner walk. Journal of Symbolic Computation, 24(3-4):465-469, 1997.
8. D. A. Cox, J. B. Little, and D. O'Shea. Ideals, Varieties, and Algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra (2nd edn.). Undergraduate Texts in Mathematics. Springer, New York, 1997.
9. X. Dahan, X. Jin, M. Moreno Maza, and E. Schost. Change of order for regular chains in positive dimension. Theoretical Computer Science, 392:37-65, 2008. (Pubitemid 351199937) (Pubitemid 351199937)
10. 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.
11. J.-C. Faugère. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In Proceedings of ISSAC 2002, pages 75-83. ACM, 2002.
12. 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.
13. J.-C. Faugère, M. Safey El Din, and P.-J. Spaenlehauer. Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology. In Proceedings of ISSAC 2010, pages 257-264. ACM, 2010.
14. E. Jonckheere and C. Ma. A simple Hankel interpretation of the Berlekamp-Massey algorithm. Linear Algebra and its Applications, 125:65-76, 1989.
15. P. Loustaunau and E. York. On the decoding of cyclic codes using Gröbner bases. Applicable Algebra in Engineering, Communication and Computing, 8(6):469-483, 1997. (Pubitemid 127554610) (Pubitemid 127554610)
16. C. Pascal and E. Schost. Change of order for bivariate triangular sets. In Proceedings of ISSAC 2006, pages 277-284. ACM, 2006.
17. K. Saints and C. Heegard. Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Gröbner bases. IEEE Transactions on Information Theory, 41(6):1733-1751, 2002.
18. S. Sakata. Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array. Journal of Symbolic Computation, 5(3):321-337, 1988.
19. S. Sakata. Extension of the Berlekamp-Massey algorithm to N dimensions. Information and Computation, 84(2):207-239, 1990. (Pubitemid 20647449) (Pubitemid 20647449)
20. D. Wiedemann. Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory, 32(1):54-62, 1986.