Skip to main content
SpringerLink
Log in

Factoring Polynomials over Local Fields II

  • Conference paper
Book cover Algorithmic Number Theory (ANTS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6197))

Included in the following conference series:

Abstract

We present an algorithm for factoring polynomials over local fields, in which the Montes algorithm is combined with elements from Zassenhaus Round Four algorithm. This algorithm avoids the computation of characteristic polynomials and the resulting precision problems that occur in the Round Four algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cannon, J.J., et al.: The computer algebra system Magma. University of Sydney (2010), http://magma.maths.usyd.edu.au/magma/

  2. Cantor, D.G., Gordon, D.: Factoring polynomials over p-adic fields. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 185–208. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Ford, D., Letard, P.: Implementing the Round Four maximal order algorithm. Journal de Théorie des Nombres de Bordeaux 6, 39–80 (1994)

    MATH  MathSciNet  Google Scholar 

  4. Ford, D., Pauli, S., Roblot, X.-F.: A Fast Algorithm for Polynomial Factorization over ℚ p . Journal de Théorie des Nombres de Bordeaux 14, 151–169 (2002)

    MATH  MathSciNet  Google Scholar 

  5. Ford, D., Veres, O.: On the Complexity of the Montes Ideal Factorization Algorithm. In: Hanrot, G., Morain, F., Thomé, E. (eds.) ANTS-IX, July 19-23. LNCS, vol. 6197, pp. 174–185. Springer, Heidelberg (2010)

    Google Scholar 

  6. Kaltofen, E., Shoup, V.: Subquadratic-time factoring of polynomials over finite fields. Math. Comp. 67 (1998)

    Google Scholar 

  7. Guardia, J., Montes, J., Nart, E.: Newton polygons of higher order in algebraic number theory (2008), arXiv:0807.2620

    Google Scholar 

  8. Guardia, J., Montes, J., Nart, E.: Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields (2008), arXiv:0807.4065

    Google Scholar 

  9. MacLane, S.: A Construction for absolute values in polynomial rings. Trans. Amer. Math. Soc. 40, 363–395 (1936)

    MATH  MathSciNet  Google Scholar 

  10. Montes, J., Nart, E.: On a Theorem of Ore. Journal of Algebra 146, 318–334 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Montes, J.: Polígonos de Newton de orden superior y aplicaciones aritméticas, PhD Thesis, Universitat de Barcelona (1999)

    Google Scholar 

  12. Ore, Ö.: Newtonsche Polygone in der Theorie der algebraischen Körper. Math. Ann. 99, 84–117 (1928)

    Article  MATH  MathSciNet  Google Scholar 

  13. PARI/GP, version 2.3.4, Bordeaux (2008), http://pari.math.u-bordeaux.fr/

  14. Pauli, S.: Factoring polynomials over local fields. J. Symb. Comp. 32, 533–547 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. Schönhage, A., Strassen, V.: Schnelle Multiplikation großer Zahlen. Computing 7, 281–292 (1971)

    Article  MATH  Google Scholar 

  16. Stein, W., et al.: SAGE: Software for Algebra and Geometry Experimentation (2007), http://www.sagemath.org

  17. Veres, O.: On the Complexity of Polynomial Factorization over p-adic Fields, PhD Dissertation, Concordia University, Montreal (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of North Carolina at Greensboro, Greensboro, NC, 27412, USA

    Sebastian Pauli

Authors
  1. Sebastian Pauli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIP/ENS-Lyon, 46, allée d’Italie, 69364, Lyon, Cedex 07, France

    Guillaume Hanrot

  2. Laboratoire d’Informatique (CNRS/UMR 7650), École polytechnique, 91128, Palaiseau Cedex, France

    François Morain

  3. INRIA Nancy, project CARAMEL, 615 rue du jardin botanique, 54602, Villers-lès-Nancy Cedex,, France

    Emmanuel Thomé

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pauli, S. (2010). Factoring Polynomials over Local Fields II. In: Hanrot, G., Morain, F., Thomé, E. (eds) Algorithmic Number Theory. ANTS 2010. Lecture Notes in Computer Science, vol 6197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14518-6_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14518-6_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14517-9

  • Online ISBN: 978-3-642-14518-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation