Skip to main content

Galois theory and primality testing

  • Conference paper
  • First Online:
Orders and their Applications

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1142))

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.95
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. M.F. Atiyah, I.G. Macdonald, Introduction to commutative algebra, Addison-Wesley, Reading, Mass., 1969.

    MATH  Google Scholar 

  2. N. Bourbaki, Algèbre commutative, Chapitres 1 et 2, Hermann, Paris, 1961.

    Google Scholar 

  3. J. Brillhart, D.H. Lehmer, J.L. Selfridge, New primality criteria and factorizations of 2m±1, Math. Comp. 29 (1975), 620–647.

    MathSciNet  MATH  Google Scholar 

  4. S.U. Chase, D.K. Harrison, A. Rosenberg, Galois theory and Galois cohomology of commutative rings, Memoirs Amer. Math. Soc. 52 (1965), 15–33.

    MathSciNet  MATH  Google Scholar 

  5. H. Cohen, H.W. Lenstra, Jr., Primality testing and Jacobi sums, Math. Comp. 42 (1984), 297–330.

    Article  MathSciNet  MATH  Google Scholar 

  6. F. DeMeyer, E. Ingraham, Separable algebras over commutative rings, Lecture Notes in Math. 181, Springer-Verlag, Berlin, 1971.

    MATH  Google Scholar 

  7. J.D. Dixon, Factorization and primality tests, Amer. Math. Monthly 91 (1984), 333–352.

    Article  MathSciNet  MATH  Google Scholar 

  8. D.E. Knuth, The art of computer programming, vol. 2, Seminumerical algorithms, 2nd ed., Addison-Wesley, Reading, Mass., 1981.

    Google Scholar 

  9. A.K. Lenstra, Factorization of polynomials, pp. 169–198 in

    Google Scholar 

  10. H.W. Lenstra, Jr., Primality testing, pp. 55–77 in

    Google Scholar 

  11. H.W. Lenstra, Jr., Primality testing algorithms (after Adleman, Rumely and Williams), Sém. Bourbaki 33 (1980/1981), Exposé 576, pp. 243–257 in: Lecture Notes in Math. 901, Springer-Verlag, Berlin, 1981.

    Chapter  Google Scholar 

  12. H.W. Lenstra, Jr., Primality testing with Artin symbols, pp. 341–347 in: N. Koblitz (ed.), Number theory related to Fermat’s last theorem, Progress in Mathematics 26, Birkhäuser, Boston, 1982.

    Chapter  Google Scholar 

  13. H.W. Lenstra, Jr., R. Tijdeman (eds), Computational methods in number theory, Mathematical Centre Tracts 154/155, Mathematisch Centrum, Amsterdam, 1982.

    MATH  Google Scholar 

  14. H.C. Williams, Primality testing on a computer, Ars Combin. 5 (1978), 127–185.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Irving Reiner Klaus W. Roggenkamp

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Lenstra, H.W. (1985). Galois theory and primality testing. In: Reiner, I., Roggenkamp, K.W. (eds) Orders and their Applications. Lecture Notes in Mathematics, vol 1142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0074800

Download citation

  • DOI: https://doi.org/10.1007/BFb0074800

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15674-1

  • Online ISBN: 978-3-540-39601-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics