| An Algorithm For Selecting a Generator of Z_p |
| |
| 作者姓名： | Shaohua Zhang Gongliang Chen Huanguo Zhang Chunhong Wang |
| |
| 作者单位： | Wuhan Maritime Communications Research Institute，CSIC. School of Information Security Engineering of Shanghai Jiaotong University. Shanghai School of Computing Science of Wuhan University. Wuhan |
| |
| 摘 要： | How to select a generator of Zp* is an important problem in cryptographic applications, where p is an odd prime. In this paper, we mainly consider the especial case that p is a safe prime, and give an algorithm for selecting a generator of Zp*,and find all generators of Zp* , where p is a safe prime. Our algorithm is more faster than the algorithm in 1]. Based on the proposed algorithm, one could find all generators of Zp* as well, where p is a perfect prime.
|
An Algorithm For Selecting a Generator of Z_p |
| |
| Shaohua Zhang Gongliang Chen Huanguo Zhang Chunhong Wang.An Algorithm For Selecting a Generator of Z_p[J].China Information Security,2005(7). |
| |
| Authors: | Shaohua Zhang Gongliang Chen Huanguo Zhang Chunhong Wang |
| |
| Abstract: | How to select a generator of Zp* is an important problem in cryptographic applications, where p is an odd prime. In this paper, we mainly consider the especial case that p is a safe prime, and give an algorithm for selecting a generator of Zp*,and find all generators of Zp* , where p is a safe prime. Our algorithm is more faster than the algorithm in 1]. Based on the proposed algorithm, one could find all generators of Zp* as well, where p is a perfect prime. |
| |
| Keywords: | safe prime perfect prime generator primitive root discrete logarithms |
| 本文献已被 CNKI 等数据库收录！ |
