摘要
研究了密钥生成的一般方法 ,即确定性素数产生和概率性素数产生方法 ,并给出了利用 Miller
RSA Public Key Crytosystem was founded by Rivest,Shami and Adleman who came from MIT in 1978.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.
出处
《武汉理工大学学报》
CAS
CSCD
2001年第6期37-40,共4页
Journal of Wuhan University of Technology
