Generation of Great Prime Number in RSA Public Key Cryptosystem
Zhang Ruoyan · Computer Technology and Development · 2008
The RSA algorithm based on the numeric theory is the best encryption algorithm in public key cryptosystems.It is much complicated and difficult in generating a great prime number,because the great prime number directly affects the safety of the RSA encryption algorithm.Works at the common generating algorithms,that is,certain generating algorithms and probabilistic generating algorithms,and demonstrates a programming algorithm based on Miller-Rabin algorithm improved by Montgomery algorithm and Pocklington theorem.This programming algorithm constructs a great prime number generating algorithms,for improving the safety and run-time rate of the RSA algorithm.