摘要
Diffie-Hellman密钥交换是一个可以使通信双方在不可信信道上建立共享密钥,并使之应用于后继对称密钥通信系统的一种密码协议。本原根是实现Diffie-Hellman密钥交换协议的一个核心参数,直接影响协议本身的安全性。对于大素数,确定其本原根是一个复杂的过程,如果根据定义来检测本原根,会因为运算开销太大而影响保密通信性能。本文阐述并证明了一个能够快速确定本原根的算法,给出了流程设计和基于JAVA的程序实现。
Diffie-Hellman key exchange is a cryptographic protocol which allows two parties to jointly establish a shared secret key over an insecure communications channel. This key can then be used to encrypt subsequent communications using a symmetric key cipher. Primitive root is a kernel parameter to implement Diffie-Hellman key exchange protocol and affects the security of the protocol directly. It is a difficult problem for a big prime integer, if we select a primitive root according to its definition the performance of the secret communication could be affected seriously since the operation cost is very high. So this paper presents and proves an algorithm for searching a primitive root with high efficiency and gives the design of flow and corresponded JAVA program.
出处
《微计算机信息》
北大核心
2006年第08X期101-103,共3页
Control & Automation
基金
山西省教育厅2004年省级高校科研项目资助编号20041342
