Skip to main content
Springer Nature Link
Log in

Primality Tests Based on Fermat’s Little Theorem

  • Conference paper
Distributed Computing and Networking (ICDCN 2006)

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

Included in the following conference series:

  • 667 Accesses

Abstract

In this survey, we describe three algorithms for testing primality of numbers that use Fermat’s Little Theorem.

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.

Similar content being viewed by others

References

  1. Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics 160(2), 781–793 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Lidl, R., Niederreiter, H.: Introduction to finite fields and their applications. Cambridge University Press, Cambridge (1986)

    MATH  Google Scholar 

  3. Miller, G.L.: Riemann’s hypothesis and tests for primality. J. Comput. Sys. Sci. 13, 300–317 (1976)

    Article  MATH  Google Scholar 

  4. Rabin, M.O.: Probabilistic algorithm for testing primality. J. Number Theory 12, 128–138 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  5. Solovay, R., Strassen, V.: A fast Monte-Carlo test for primality. SIAM Journal on Computing 6, 84–86 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  6. Wiles, A.: Modular elliptic curves and fermat’s last theorem. Annals of Mathematics 141, 443–551 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Indian Institute of Technology, Kanpur

    Manindra Agrawal

Authors
  1. Manindra Agrawal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Iowa State University, 230 Atanasoff Hall, 50011, Ames, IA, USA

    Soma Chaudhuri

  2. Computer Science Department SUNY at Stony Brook Stony Brook, 11794-4400, NY, USA

    Samir R. Das

  3. Department of Computer Science & Engineering, Indian Institute of Technology, 781039, Guwahati, India

    Himadri S. Paul

  4. Dept. of Electrical and Computer Engineering, Iowa State University, 50010, Ames, IA, USA

    Srikanta Tirthapura

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Agrawal, M. (2006). Primality Tests Based on Fermat’s Little Theorem. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds) Distributed Computing and Networking. ICDCN 2006. Lecture Notes in Computer Science, vol 4308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11947950_32

Download citation

  • DOI: https://doi.org/10.1007/11947950_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68139-7

  • Online ISBN: 978-3-540-68140-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics