| 基于密钥交换中离散对数生成元的研究 |
| |
| 引用本文： | 魏钦冰. 基于密钥交换中离散对数生成元的研究[J]. 菏泽学院学报, 2004, 26(4): 30-32 |
| |
| 作者姓名： | 魏钦冰 |
| |
| 作者单位： | 菏泽学院计算机与信息工程系,山东,菏泽,274015 |
| |
| 摘 要： | 从离散对数的生成元的选择问题出发,根据欧拉定理和拉格朗日定理提出加快寻找生成元的简便算法,该算法的重要思想是如果我们选择安全素数P=2Q+1,则判断集合ZP中的元素是否是生成元的次数达到最少.该算法加快了生成元的寻找速度,节约了计算时间和计算空间.
|
| 关 键 词： | 密钥交换 生成元 安全素数 |
| 文章编号： | 1003-6318(2004)04-0030-03 |
| 修稿时间： | 2004-07-03 |
Research of Turning into Original Root of Separate Logarithm While Exchanging on the Basis of the Key |
| |
| WEI Qin-bing. Research of Turning into Original Root of Separate Logarithm While Exchanging on the Basis of the Key[J]. , 2004, 26(4): 30-32 |
| |
| Authors: | WEI Qin-bing |
| |
| Abstract: | Begain with the choosing question of Original root of separate logarithm,we can propose acceleratingly looking for the simple and convenient algorithm according to the theorem of Euler and Lagrangian theorem.The important thought of this algorithm is: if our choice Safe Prime P =2*Q +1, judges whether the element in set Z_P is that the number of times of Original root reaches least. This algorithm has accelerated the speed of searching of Original root and has economized time and computer memory of calculating. |
| |
| Keywords: | The key exchanging Original root Safe Prime |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
