密钥交换协议中本原根的快速更新算法  

Rapidly Updating Algorithm of Primitive Root in Key Exchange Protocol

作　　者：严波涛[1] 潘晓中[1] 张薇[1] 

机构地区：[1]武警工程学院电子技术系网络与信息安全武警部队重点实验室,西安710086

出　　处：《计算机工程》2010年第3期186-188,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60842006)

摘　　要：Diffie-Hellman密钥交换协议可以使通信双方在不可信信道上建立共享密钥,从而实现安全通信。提出该协议的安全性建立在DH安全大素数P及其本原根g的基础上。证明了形如P=2q+1(其中q=4i+1是大素数)的DH安全大素数P有q-1个本原根,由P的最小本原根2可以快速生成其余本原根,并提出快速生成安全大素数P及其本原根g更新的算法。Diffie-Hellman key exchange is a cryptographic protocol which allows two parties to jointly establish a shared secret key over an insecure communications channel, whose security is based on the DH large safe prime P and primitive root g. It proves that the number of primitive root of P is q-1, ifP is derived from the serial P=2q＋1（q from q=4i＋1）, every primitive root of P can be generated from the primitive root 2 rapidly and conveniently. A rapid algorithm of DH large safe prime generation and the updating of its primitive root are proposed.

关 键 词：密钥交换 本原根 大素数 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]