ABSTRACT
Many cryptographic algorithms require prime numbers of a certain size. If the prime need not be secret, then one can get one from a book or web site. There are thousands of primes in the Cunningham Project electronic book [18] or the web site with the full tables from that work, https://www.cerias.purdue.edu/homes/ssw/cun/third/index.html" xmlns:xlink="https://www.w3.org/1999/xlink">https://www.cerias.purdue.edu/homes/ssw/cun/third/index.html. Alternatively, one can form a random large prime by one of the methods for finding secret primes.
