Lattices and factorization of polynomials over algebraic number fields

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

Volumn 144 LNCS, Issue , 1982, Pages 32-39

  Lenstra, A K ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC NUMBER FIELDS; ALGORITHMS; FACTORIZATION; LATTICES; THEOREMS;

MATHEMATICAL TECHNIQUES;

EID: 0020233779     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-11607-9_4     Document Type: Conference Paper

References (11)

1. D.G. Cantor & H. Zassenhaus, A New Algorithm for Factoring Polynomials Over Finite Fields, Math. Comp. 36 (1981) pp 587–592.
2. U. Dieter, How to calculate Shortest Vectors in a Lattice, Math. Comp. 29 (1975), pp 827–833.
3. A.K. Lenstra, Lattices and Factorization of Polynomials, Mathematisch Centrum, Amsterdam, Report IW 190/81.
4. H.W. Lenstra Jr., Integer programming with a fixed number of variables, University of Amsterdam, Department of Mathematics, Report 81-03.
5. B.M. Trager, Algebraic Factoring and Rational Function Integration, Proc. SYMSAC 76, pp 219–226.
6. B.L. van der Waerden, Moderne Algebra, Springer, Berlin, 1931.
7. P.S. Wang, Factoring Multivariate Polynomials over Algebraic Number Fields, Math. Comp. 30 (1976), pp 324–336.
8. P.S. Wang, An Improved Multivariate Polynomial Factoring Algorithm, Math. Comp. 32(1978), pp 1215–1231.
9. P.J. Weinberger & L.P. Rothschild, Factoring Polynomials over Algebraic Number Fields, ACM Transactions on Math. Software, 2 (1976) pp 335–350.
10. H. Zassenhaus, On Hensel Factorization, I, J. of Number Theory 1 (1969), pp 291–311.
11. H. Zassenhaus, A Remark on the Hensel Factorization Method, Math. Comp. 32 (1978), pp 287–292.