Skip to main content
SpringerLink
Log in

On a simple primality testing algorithm

  • Number Theory Algorithms
  • Conference paper
  • First Online:
EUROSAM 84 (EUROSAM 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 174))

Included in the following conference series:

  • 116 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.M.Adleman, "On Distinguishing Primes from Composite Numbers" (Abstract), Proc. 21st Annual IEEE Symposium on Foundations of Computer Science, 1980, 387–406.

    Google Scholar 

  2. L.M.Adleman, R.Mcdonnell, "An Application of Higher Reciprocity to Computational Number Theory"(Abstract),Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982, 100–106.

    Google Scholar 

  3. L.M. Adleman,C. Pomrerance,and R.S. Rumely, "On Distinguishing Primes from Composite Numbers", Annal of Math., 117(1983), 173–206.

    Google Scholar 

  4. A.V. Aho,J.E. Hopcroft, and J.D. Ullman, "The Design and Analysis of Algorithms", Addison-Wesley, Reading,MA 1974.

    Google Scholar 

  5. E.R. Berlekamp, "Factoring Polynomials over Large Finite Fields",Math. Comput.,24(1970),713–735.

    Google Scholar 

  6. J.W.S.Cassel, A. Fröhlich(editors),Algebraic Number Theory, Thompson(Washington, D.C.), 1967.

    Google Scholar 

  7. H.Cohen, H.W.Lenstra,Jr., "Primality Testing and Jacobi Sums", to appear in Math. Comput.

    Google Scholar 

  8. S.Lang,"Algebraic Number Theory", Addison-Wesley Publishing Company,1970.

    Google Scholar 

  9. H.W.Lenstra,Jr., "Primality Testing Algorithms"(after Adleman,Rumely and Williams), Seminar Bourbaki,33(1980–81),no.576,Lecture Notes in Math,Springer,243–257.

    Google Scholar 

  10. H.W. Lenstra,Jr., "Primality Testing with Artin Symbols", Number theory related to Fermat's last theorem, Progress in Math., 341–347.

    Google Scholar 

  11. G.L. Miller, "Rieman Hypothesis and Tests For Primality',J.C.S.S,13,1976,300–317.

    Google Scholar 

  12. M.O.Rabin, "Probabilistic Algorithms",Algorithms and Complexity, New Directions and Recent Results, Academic,Press,21–40.

    Google Scholar 

  13. M.O. Rabin,"Probabilistic Algorithms in Finite Fields", SIAM J. Comput.,Vol.9,no.2,1980,273–280.

    Google Scholar 

  14. J.Serre,"Local Fields",Springer-Verlag,Grad. text. 67

    Google Scholar 

  15. R.Solovay,V.Strassen,"Fast Monte-Carlo Tests for Primality",SIAM Cornput. 1977,84–85.

    Google Scholar 

  16. L.C.Washington,"Introduction to Cyclotomic Fields",Springer-Verlag,Grad. Text. 83.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Princeton University, 08544, Princeton, New Jersey

    Ming-Deh A. Huang

Authors
  1. Ming-Deh A. Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Fitch

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, MD.A. (1984). On a simple primality testing algorithm. In: Fitch, J. (eds) EUROSAM 84. EUROSAM 1984. Lecture Notes in Computer Science, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032854

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13350-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation