| 一类强素数的确定与生成 |
| |
| 引用本文： | 肖应雄,张韶华.一类强素数的确定与生成[J].孝感学院学报,2006,26(6):59-61. |
| |
| 作者姓名： | 肖应雄 张韶华 |
| |
| 作者单位： | 1. 孝感学院,数学系,湖北,孝感,432000
2. 山东大学数学与系统科学学院,山东,济南,250100 |
| |
| 摘 要： | 给出了确定一类素数p是否为强素数的多项式时间算法,其计算量为O(log32p),并给出了生成这类强素数的算法。
|
| 关 键 词： | 素性检验 强素数 RSA公钥密码体制 |
| 文章编号： | 1671-2544（2006）06-0059-03 |
| 收稿时间： | 2006-09-20 |
| 修稿时间： | 2006-09-20 |
Determination and Generation of a Kind of Strong Primes |
| |
| XIAO Ying-xiong,ZHANG Shao-hua.Determination and Generation of a Kind of Strong Primes[J].JOURNAL OF XIAOGAN UNIVERSITY,2006,26(6):59-61. |
| |
| Authors: | XIAO Ying-xiong ZHANG Shao-hua |
| |
| Institution: | 1, Department of Mathematics, Xiaogan University, Xiaogan, Hubei 432000, China ;2. School of Mathematics and System Science, Shandong University, J innan, Shandong 250100, China |
| |
| Abstract: | In this paper,we give a deterministic time algorithm that determines whether a kind of prime is a strong prime.Then we give algorithms for generating this kind of strong primes. |
| |
| Keywords: | primality testing strong prime RSA public-key cryptosystem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
