RSA公开密钥密码体制的密钥生成研究

RSA公开密钥密码体制的密钥生成研究 Generating Strong Primes Study in RSA Cryptosystem 杨建沾 YANG Jian\|zhan 1 first-author 王勇 WANG Yong 1 易星 YI Xing 1 武汉大学数学与计算机科学学院,武汉,430072 武汉大学数学与计算机科学学院,武汉,430072 College of Mathematics and Computer Science,Wuhan University College of Mathematics and Computer Science,Wuhan University 介绍了密钥生成的一般方法，即确定性素数产生和概率性素数产生方法，并给出了利用 Ｍｉｌｌｅｒ Ｒａｂｉｎ测试和 Ｐｏｃｋｌｉｎｇｔｏｎ 定理生成强伪素数的算法实现 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. Pocklington定理 MillerRabin测试 强素数 Pocklington theorem Miller Rabin tests strong primes TN918 湖北省重点科技基金 1999-03-01 2021-04-01 3