| 基于密钥交换中离散对数生成元的研究 |
| |
| 引用本文： | 张清华. 基于密钥交换中离散对数生成元的研究[J]. 重庆邮电学院学报(自然科学版), 2002, 14(3): 90-92 |
| |
| 作者姓名： | 张清华 |
| |
| 作者单位： | 重庆邮电学院 重庆400065 |
| |
| 摘 要： | 从离散对数的生成元的选择问题出发，根据欧拉定理和拉格朗日定理提出加快寻找生成元的简便算法，该算法的重要思想是：如果我们选择安全素P＝2＊Q＋1，则判断集合ZP中的元素是否是生成元的次数达到最少。该算法加快了生成元的寻找速度，节约了计算时间和计算空间。
|
| 关 键 词： | 离散对数生成 密钥交换 Diffie－Hellman公钥 安全素数 计算机安全技术 数据加密 |
Researching of Discrete Logarithm''''s Primitive Root in Key Exchange |
| |
| ZHANG Qing-hua. Researching of Discrete Logarithm''''s Primitive Root in Key Exchange[J]. Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition), 2002, 14(3): 90-92 |
| |
| Authors: | ZHANG Qing-hua |
| |
| Abstract: | This paper sets to research from the problem of selecting primitive root of discrete logarithm, and according to Euler theory and Lagrance theory, presents an algorithm of searching the primitive root, accelerates the speed of searching the primitive root. The importance of this algorithm is if a large safe prime P=2*Q+1 (P,Q are large primes) is selected, the number of the primitive root generated in set Zp can be decided in least times. The algorithm will save the computing time and the computation space. |
| |
| Keywords: | key exchange Diffie-Hellman public key primitive root safe prime |
| 本文献已被 CNKI 维普 等数据库收录！ |
