Advertisement

Polynomial factorisation: an exploration of Lenstra's algorithm

  • JA Abbott
  • JH Davenport
Polynomial Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 378)

Abstract

We describe various design decisions and problems encountered during the implementation of the Lenstra factoriser [Lenstra82] in REDUCE. A practical viewpoint is taken with descriptions of both successful and unsuccessful attempts at tackling some of the problems. Particular areas considered include bounding coefficients of factors, the Cantor-Zassenhaus factoriser [Cantor81], Hensel lifting, basis reduction, and trial division of polynomials. We give an empirical formula which estimates the running time of our basis reduction routine.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Abbott85]
    J A Abbott, R J Bradford and J H Davenport, “A Remark on Factorisation,” SIGSAM Bulletin 19(2)(May 1985).Google Scholar
  2. [Abbott86]
    J A Abbott, R J Bradford and J H Davenport, “The Bath Algebraic Number Package,” Proc. ACM SYMSAC 86, ed. B W Char (1986).Google Scholar
  3. [Abbott87a]
    J A Abbott and J H Davenport, “A Remark on a Paper by Wang: another surprising property of 42,” submitted to Math. Comp. Google Scholar
  4. [Abbott87b]
    J A Abbott, Ph.D. thesis, in preparation.Google Scholar
  5. [Abdali77]
    S K Abdali, B F Caviness and A Pridor, “Modular Polynomial Arithmetic in Partial Fraction Decomposition,” Proc. 1977 MACSYMA Users' Conference, NASA (Jul 1977).Google Scholar
  6. [Berlekamp70]
    E R Berlekamp, “Factoring Polynomials over Large Finite Fields,” Math. Comp. 24(111) (Jul 1970).Google Scholar
  7. [Cantor81]
    D G Cantor and H Zassenhaus, “A New Algorithm for Factoring Polynomials over Finite Fields,” Math. Comp. 36(154) (Apr 1981).Google Scholar
  8. [Fitch77]
    J P Fitch and A C Norman, “Implementing LISP in a High-Level Language,” Software — Practice and Experience 7, (1977).Google Scholar
  9. [Ford78]
    D J Ford, “On the Computation of the Maximal Order in a Dedekind Domain,” Ph.D. thesis, Ohio State University (1978).Google Scholar
  10. [Kaltofen83]
    E Kaltofen, “On the Complexity of Finding Short Vectors in Integer Lattices,” Proc. EUROCAL 83, Springer LNCS #162 (1983).Google Scholar
  11. [Knuth81]
    D E Knuth, “Seminumerical Algorithms,” Addison-Wesley (1981) 2nd ed.Google Scholar
  12. [Langemyr87]
    L Langemyr and S McCallum, “The Computation of Polynomial Greatest Common Divisors Over an Algebraic Number Field,” To appear in Proc. EUROCAL 87.Google Scholar
  13. [Lenstra82]
    A K Lenstra, “Lattices and Factorisation of Polynomials over Algebraic Number Fields,” Proc. EUROCAM 82, LNCS 144 pp.32–39 (1982).Google Scholar
  14. [LLL82]
    A K Lenstra, H W Lenstra and L Lovász, “Factoring Polynomials with Rational Coefficients”, Math. Ann., (261) (1982).Google Scholar
  15. [Mignotte76]
    M Mignotte, “Some Problems about Polynomials,” Proc. ACM SYMSAC, ed R D Jenks, (1976).Google Scholar
  16. [Mignotte81]
    M Mignotte, “Some Inequalities About Univariate Polynomials,” Proc. SYMSAC 81, (1981).Google Scholar
  17. [Schönhage84]
    A Schönhage, “Factorisation of Univariate Integer Polynomials by Diophantine Approximation and an Improved Basis Reduction Algorithm,” Preprint for Proc. ICALP 1984, (1984).Google Scholar
  18. [Schnorr85]
    C P Schnorr, “A More Efficient Algorithm for Lattice Basis Reduction,” Preprint, Universität Frankfurt (Oct 1985).Google Scholar
  19. [Trager76]
    B M Trager, “Algebraic Factoring and Rational Function Integration,” Proc. ACM SYMSAC, ed. R D Jenks, (1976).Google Scholar
  20. [Wang76]
    P S Wang, “Factoring Multivariate Polynomials over Algebraic Number Fields,” Math. Comp., 30(134) (Apr 1976).Google Scholar
  21. [Wang82]
    P S Wang, M J T Guy and J H Davenport, “P-adic Reconstruction of Rational Numbers,” SIGSAM Bulletin, (2) (May 1982).Google Scholar
  22. [Weinberger76]
    P J Weinberger and L P Rothschild, “Factoring Polynomials over Algebraic Number Fields,” ACM ToMS, 2(4) (Dec 1976).Google Scholar
  23. [Yun73]
    D Y Y Yun, “The Hensel Lemma in Algebraic Manipulation,” Ph.D. thesis, MIT (1973).Google Scholar
  24. [Zassenhaus69]
    H Zassenhaus, “On Hensel Factorisation I,” J.N.T., 1 (1969).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • JA Abbott
    • 1
  • JH Davenport
    • 1
  1. 1.School of Mathematical SciencesUniversity of BathBath, AvonEngland

Personalised recommendations