期刊文献+

改进的具有轻量级结构的Veron身份认证及数字签名方案 被引量:4

Improved Veron's Identification with Lightweight Structure and Digital Signature Scheme
下载PDF
导出
摘要 目前大部分的公钥密码方案都基于大整数分解或离散对数难题,这些困难问题在量子计算机中都可以在多项式时间内求解,而基于纠错码的密码方案可以抵抗量子计算机的攻击,所以很有必要研究基于纠错码的身份认证及数字签名方案。Veron身份认证方案总体性能不错,但公钥太大,大约有150k比特。在Veron方案的基础上,采用双循环矩阵来进一步减小Veron方案中的密钥大小,即通过双循环矩阵把私钥嵌入到公钥中。这样做的好处有3点:1)所基于的安全性是已被证明为安全的循环码;2)改进以后,公钥只有1041比特,而私钥也只有1041比特;3)每轮数据的传输量比较少。然后分析所构造方案的安全性,将其归结到GSD困难问题上。最后,采用FS方法将改进后的身份认证方案转换为数字签名方案,并对该方案进行正确性证明和安全性证明。循环结构的使用使得改进方案实现起来比较容易并且效率较高。这些特点使得所提方案在轻量级结构的场合具有广阔的应用前景,比如手持终端、云存储环境下的数字签名等场合。 At present,most of the public key cryptography schemes are based on hard problems such as large integer factorization or discrete logarithm. All these hard problems ean be solved by a quantum computer in polynomial time. Cryptographic schemes based on error-correcting codes can resist the attacks by a quantum computer, so it is necessary to design identification schemes or signature schemes based on error-correcting codes. Veron's identification scheme is very nice in general, but it's public key is too long. Based on Veron's scheme, we used double eireulant matrix to further reduce the size of public key in Veron' s scheme. The secret key is embedded into the public key directly, which has the three following advantages. The security relies on a problem which is related to well-known and well-studied codes, namely the double cireulant codes. The size of the public key is very low, only 1041 bits in a typical set-up, and the pri- vate key is also 1041bits. The transmission rate of each round is very low. Then we analyzed the security of the im- proved scheme. Its security can be redueed to GSD hard problem. At last, we used FS paradigm to transform the im- proved identification scheme into signature scheme, and then proved the correctness and security of the scheme. In the improved scheme, the use of cyclic structure makes it relatively easy to implement and have high efficiency. These chara- cteristics make our variant highly attractive for lightweight implementations, especially in handheld terminal or cloud storage environment.
作者 叶君耀 郑东 任方 YE Jun-yao ZHENG Dong REN Fang(Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China School of Information Engineering,Jingdezhen Ceramic Institute,Jingdezhen 333403, China National Engineering Laboratory for Wireless Security,Xi'an University of Posts and Telecommunications,Xi'an 710121,China)
出处 《计算机科学》 CSCD 北大核心 2017年第3期168-174,共7页 Computer Science
基金 国家自然科学基金项目(61472472 61272037) 陕西省自然科学基金重点项目(2013JZ020) 陕西省自然科学基金项目(2015JQ6262) 江西省教育厅项目(GJJ150934 GJJ150895)资助
关键词 后量子密码 循环码 数字签名 身份认证 纠错码 Post-quantum cryptography, Cyclic codes,Digital signature, Identification, Error correcting codes
  • 相关文献

参考文献2

  • 1赵书让..有限域上新的离散对数问题[D].山东大学,2014:
  • 2岳殿武编著..信息论与编码简明教程[M].北京:清华大学出版社,2015:201.

同被引文献48

引证文献4

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部