Generating Strong Primes Study in RSA Cryptosystem

Jian Jun Yang · Wuhan University Journal · 1999

How to generate strong primes is an important subject in RSA crytosystem. This thesis works at the common generating ways, that is , certain generating algorithms and probabilistic generating algorithms, and demostrates a programming algorithm about how to create strong fake primes based on Miller Rabin tests and Pocklington theorem.

Read the paper · More papers on PaperTik