摘要
作者阐述了大素数在RSA公钥密码体制中的作用和意义,在概括当前两种主要的素数产生方法的基础上,说明了两种方法的优缺点,同时介绍了几种生成素数的算法。最后,结合M iller_Rabin测试方法、传统的素数筛选法和确定型多项式算法的各自优点,提出了一种新的生成大素数的方法。
The function and significance of large primes in RSA are introduced. Two generating methods of primes, their advantages and disadvantages are discussed. Several algorithms of primes＇ generation are also introduced. Generated by traditional screen method, tested by Miller_Rabin algorithm and confirmed by polynomial method, a new efficient scheme for large primes is proposed.
出处
《贵州大学学报（自然科学版）》
2005年第4期427-430,共4页
Journal of Guizhou University:Natural Sciences
