Prime Number Generation
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 .
KeywordsFermat Suffix Estima
Unable to display preview. Download preview PDF.