摘要
介绍了密钥生成的一般方法，即确定性素数产生和概率性素数产生方法，并给出了利用 Ｍｉｌｌｅｒ Ｒａｂｉｎ测试和 Ｐｏｃｋｌｉｎｇｔｏｎ
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.
出处
《武汉大学学报（自然科学版）》
CSCD
1999年第3期303-306,共4页
Journal of Wuhan University(Natural Science Edition)
基金
湖北省重点科技基金
