计算机工程 ›› 2009, Vol. 35 ›› Issue (13): 139-140,.doi: 10.3969/j.issn.1000-3428.2009.13.048

• 安全技术 • 上一篇    下一篇

基于辫群的密钥认证方案

卓泽朋1,魏仕民2,马陵勇1   

  1. (1. 淮北煤炭师范学院数学科学学院,淮北 235000;2. 淮北煤炭师范学院计算机科学与技术学院,淮北 235000)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-07-05 发布日期:2009-07-05

Key Authentication Scheme Based on Braid Group

ZHUO Ze-peng1, WEI Shi-min2, MA Ling-yong1   

  1. (1. School of Mathematics & Science, Huaibei Coal Industry Teachers College, Huaibei 235000; 2. School of Computer Science & Technology, Huaibei Coal Industry Teachers College, Huaibei 235000)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-07-05 Published:2009-07-05

摘要: 介绍辫群的基本概念及其关键特性,研究其存在的问题,如字问题、共轭问题和根问题,并利用这些困难问题设计一类密码协议。根据辫群中左右子群的元素可交换性,提出一种基于辫群上p次根问题和共轭查找问题的密钥认证方案,同时通过仿真实验,验证该方案的有效性。

关键词: 辫群, 共轭问题, 根问题

Abstract: The basic concept and the key characteristic of braid groups are introduced. The existed problems in it are researched, such as the word problem, conjugacy problem, and root problem. By using these difficult problems, some kinds of code protocols are designed. On basis of it, and according to the exchangeability of subgroup elements in braid groups, a novel key authentication scheme based on p-th root problem and conjugacy research problem in braid groups is proposed. Simulation experimental results show this scheme is effective.

Key words: braid group, conjugacy problem, root problem

中图分类号: