一种基于辫群的密钥交换协议  

A Key Exchange Protocol Based on Braid Groups

作　　者：权双燕[1] 张静[2] QUAN Shuang-yan;ZHANG Jing(School of Mathematics and Computer Science,Shaanxi University of Technology,Hanzhong 723001,Shaanxi,China;Modern Industrial Innovation Practice Center,DongGuan Polytechnic,DongGuan 523808,Guangdong,China)

机构地区：[1]陕西理工大学数学与计算机科学学院,陕西汉中723000 [2]东莞职业技术学院现代工程创新实践中心,广东东莞523808

出　　处：《喀什大学学报》2022年第3期58-61,共4页Journal of Kashi University

基　　金：陕西省教育厅专项基金“基于Vague集的多属性决策模型及应用研究”(17JK0132).

摘　　要：为了抵抗量子攻击,基于分解问题(DP)和离散对数问题(DLP),通过半直积的运算法则,在辫群上构造了一种密钥交换协议.该协议利用辫群的无限、非交换性以及分解问题和离散对数问题的求解困难性保证了密钥交换协议的抗攻击性,并利用代数攻击和穷尽搜索攻击分析证明了协议具有较高的安全性.经理论分析表明,所构造的协议具有时间复杂性和空间复杂性,数据显示该密钥交换协议具有可行性.In order to resist quantum attack, a key exchange protocol is constructed on braid group by using semi-direct product algorithm based on decomposition problem(DP) and discrete logarithm problem(DLP).The security of the protocol is proved by algebraic attack analysis and exhaustive search attack analysis, which makes use of the infinite and non-commutative property of braid group and the difficulty of solving decomposition and discrete logarithm problem. The theoretical analysis shows that the constructed protocol has time complexity and space complexity, and the data shows that the key exchange protocol is feasible.

关 键 词：辫群 半直积 分解问题 离散对数问题 密钥交换协议 

分 类 号：TN918.1[电子电信—通信与信息系统] O157.4[电子电信—信息与通信工程]