Abstract
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 [22].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Buchmann, J.A. (2001). Prime Number Generation. In: Introduction to Cryptography. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-0496-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4684-0496-8_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-0498-2
Online ISBN: 978-1-4684-0496-8
eBook Packages: Springer Book Archive