Changing the ordering of Gröbner Bases with LLL: Case of Two Variables

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

Volumn , Issue , 2003, Pages 23-29

  Basiri, Abdolali ^a   Faugère, Jean Charles ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Complexity; Gr bner basis; LLL; Reduced Lattice basis

Indexed keywords

GRÖNER BASIS; REDUCED LATTICE BASIS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; THEOREM PROVING;

COMPUTATIONAL METHODS;

EID: 1542300128     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. ab curve and their application to discrete-log based public key cryptosystems. IEICE Transactions, J82-A(8):1291-1299, 1999. In Japanese. English translation in the proceedings of the Conference on The Mathematics of Public Key Cryptography, Toronto 1999.
2. ab curve and their application to discrete-log based public key cryptosystems. IEICE Transactions, J82-A(8):1291-1299, 1999. In Japanese. English translation in the proceedings of the Conference on The Mathematics of Public Key Cryptography, Toronto 1999.
3. A. Basiri, A. Enge, J.-C. Faugère, and N. Gürel. Fast arithmetics for superelliptic cubics. Extended version, available from http://www.lix.polytechnique.fr/-Labo/Andreas.Enge/vorabdrucke/super.ps, 2002.
4. A. Basiri and J.-C. Faugère. Changing the ordering of gröbner bases with LLL: Case of two variables. Technical report, Loria, http://www.inria.fr/rrrt/rr-4746.html, February 2003.
5. E. Becker, T. Mora, M. G. Marinari, and C. Traverse. The shape of the shape lemma. In Proceedings of the international symposium on Symbolic and algebraic computation, pages 129-133. ACM Press, 1994.
6. T. Becker and V. Weispfenning. Gröbner bases. Springer-Verlag, NewYork-Berlin-Heidelberg, 1993.
7. B. Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Innsbruck, 1965.
8. B. Buchberger. An algorithmical criterion for the solvability of algebraic systems. Aequationes Mathematicae, 4(3):374-383, 1970. (German).
9. B. Buchberger. A criterion for detecting unnecessary reductions in the construction of gröbner basis. In Proc. EUROSAM 79, volume 72 of Lecture Notes in Computer Science, pages 3-21. Springer Verlag, 1979.
10. B. Buchberger. A note on the complexity of constructing Gröbner bases. In van Hulzen J.A. (ed.) EUROCAL '83, European Computer Algebra Conference, volume 162 of Lecture Notes in Computer Science, pages 137-145. Springer, 1983.
11. B. Buchberger. Gröbner bases: an algorithmic method in polynomial ideal theory. In R. P. Company, editor. Recent trends in multidimensional system theory, chapter 6, pages 184-232. Bose, 1985.
12. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. Springer-Verlag, 1996. second edition.
13. 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, June 1999.
14. J.-C. Faugère. How my computer find all the solutions of cyclic 9. In Lecture Notes Series on Computing, volume 9, pages 1-12. World Scientific Publishing Co., 2001.
15. J.-C. Faugère. A new efficient algorithm for computing gröbner bases without reduction to zero f5. In T. Mora, editor, Proceedings of ISSAC, pages 75-83. ACM Press, July 2002.
16. J.-C. Faugère. Examples for LLL. Technical report, Lip6, http://calfor.lip6.fr/~jcf/Papers/LLL/index.html, April 2003.
17. 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:329-344, 1993.
18. ab curves. In W. Bosma, editor, Algorithmic Number Theory - ANTS-IV, volume 1838 of Lecture Notes in Computer Science, pages 359-376, Berlin, 2000. Springer-Verlag.
19. D. Lazard. Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. In van Hulzen J. A. (ed.) EUROCAL '83, European Computer Algebra Conference, volume 162 of Lecture Notes in Computer Science, pages 146-157. Springer-Verlag, 1983.
20. D. Lazard. Ideal bases and primary primary decompositionxase of two variables. Journal of Symbolic Computation, 1(3):261-270, September 1985.
21. A. Lenstra, H. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261:515-534, 1982.
22. A. K. Lenstra. Factoring multivariate polynomials over finite fields. J. Computer and System Sciences, 30(2):235-248, 1985.
23. K. Mahler. An analogue of minkowskl's geometry of numbers in a field of series. In Annals of Math, volume 42, pages 488-522, 1941.
24. S. Paulus. Lattice basis reduction in function fields. In J. P. Buhler, editor, Algorithmic Number Theory -ANTS-III, volume 1423 of Lecture Notes in Computer Science, pages 567-575, Berlin, 1998. Springer-Verlag.