首页 | 本学科首页   官方微博 | 高级检索  
     

辫群上新的签名体制
引用本文:隗云,熊国华,鲍皖苏,张兴凯. 辫群上新的签名体制[J]. 电子与信息学报, 2010, 32(12): 2930-2934. DOI: 10.3724/SP.J.1146.2010.00167
作者姓名:隗云  熊国华  鲍皖苏  张兴凯
作者单位:信息工程大学电子技术学院,郑州,450004;电子技术研究所,北京,100195;96610部队,北京,102208
摘    要: 辫群是构造抗量子攻击密码协议的新平台。该文基于辫群上求根问题的难解性提出了新的签名体制,并证明其在随机预言模型下能抵抗适应性选择消息的存在性伪造攻击。新体制在签名验证阶段不需要判断辫元是否存在共轭关系,计算效率比共轭签名体制、改进共轭签名体制更高;签名由一个整数和一个辫元组成,与共轭签名体制相比长度更短,与改进共轭签名体制长度相当。

关 键 词:数字签名  辫群  求根问题  随机预言模型
收稿时间:2010-03-01

New Signature Scheme over the Braid Groups
Wei Yun,Xiong Guo-hua,Bao Wan-su,Zhang Xing-kai. New Signature Scheme over the Braid Groups[J]. Journal of Electronics & Information Technology, 2010, 32(12): 2930-2934. DOI: 10.3724/SP.J.1146.2010.00167
Authors:Wei Yun  Xiong Guo-hua  Bao Wan-su  Zhang Xing-kai
Affiliation:Institute of Electronic Technology, Information Engineering University, Zhengzhou 450004, China  Institute of Electronic Technology, Beijing 100195, China  Unit 96610, Beijing 102208, China
Abstract:The braid group is a new candidate platform for constructing quantum attack-resistant cryptographic protocols. A new signature scheme is proposed based on the difficulty of the root extraction problem over braid groups, which can resist existential forgery against the adaptively chosen-message attack under the random oracle model. Compared with the Conjugacy Signature Scheme (CSS) and the Enhanced Conjugacy Signature Scheme (ECSS), the verification phase of the proposed scheme desires less computation because it does not have to determine whether two braids are conjugate. The signature is composed of an integer and a braid, which is much shorter than that of CSS and almost same as that of ECSS.
Keywords:Digital signature  Braid group  Root Extraction Problem (REP)  Random oracle model
本文献已被 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号