Prime Number Generation

  • Johannes A. Buchmann
Part of the Undergraduate Texts in Mathematics book series (UTM)


In many public-key cryptosystems, large random prime numbers are used. They are produced by generating random numbers of the right size and by testing whether those random numbers are prime. In this chapter, we explain how we can efficiently decide whether a given positive integer is a prime number. All algorithms that are presented in this chapter are implemented in the library LiDIA [46].


Positive Integer Prime Number Prime Divisor Residue Class Primitive Root 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Johannes A. Buchmann
    • 1
  1. 1.Department of Computer ScienceTechnical UniversityDarmstadtGermany

Personalised recommendations