基于准循环低密度奇偶校验码的签密方案研究

doi:10.3969/j.issn.1671-1122.2016.11.011

信息网络安全 ›› 2016, Vol. 16 ›› Issue (11): 66-72.doi: 10.3969/j.issn.1671-1122.2016.11.011

基于准循环低密度奇偶校验码的签密方案研究

刘明烨^1,²(), 韩益亮^1,², 杨晓元^1,²

1.武警工程大学电子技术系,陕西西安 710086
2.武警部队网络与信息安全保密重点实验室,陕西西安 710086

收稿日期:2016-08-20 出版日期:2016-11-20 发布日期:2020-05-13
作者简介:
作者简介：刘明烨（1991—）,男,广东,硕士研究生,主要研究方向为公钥密码学;韩益亮（1977—）,男,甘肃,副教授,博士,主要研究方向为密码学;杨晓元(1959—),男,湖南,教授,硕士,主要研究方向为密码学、可信计算。
基金资助:
国家自然科学基金[61572521,61272492,61272468];陕西省自然科学基础研究计划[2015JM6353]

Research of Signcyption Based on QC-LDC

Mingye LIU^1,²(), Yiliang HAN^1,², Xiaoyuan YANG^1,²

1. Department of Electronic Technology, Engineering University of Chinese People’s Armed Police Force, Xi’an Shaanxi 710086, China;
2. Key Laboratory of Network and Information Security, Chinese People’s Armed Police Force, Xi’an Shaanxi 710086, China;

Received:2016-08-20 Online:2016-11-20 Published:2020-05-13

摘要/Abstract

摘要：

签密是一个能同时实现数字签名和公钥加密的密码原语,并且其数据量要远低于传统的先签名后加密的方法。基于编码的密码体制是后量子密码中的一个重要方案,具有较高的计算效率,但是有密钥量过大的问题。针对这一问题,文章尝试利用准循环低密度奇偶校验码,在随机预言机的模型下,构造了一个可证明安全的签密方案。由于QC-LDPC的校验矩阵的准循环特性,可以有效地减小密钥量,与传统的先签名后加密的方法相比,密文减少了15.7%,与“一石二鸟”等基于数论的签密方案相比,计算效率有较大提高。安全性表明,方案在随机预言机模型下能达到IND-CCA2和EUF-CMA安全。

关键词: 签密, 后量子密码, 基于编码的密码体制, 准循环低密度奇偶校验码, 可证明安全

Abstract:

Signcryption is a cryptographic primitive that performs both the function of digital signature and public-key encryption, at a cost significantly lower than that required in the traditional signature-then encryption. Code based cryptography is an important scheme in post-quantum cryptography. Its computational efficiency is high but it has the drawback of large key. Aiming at solving this problem, a signcryption based on QC-LDPC was proposed the random oracle model. Because of the quasi cyclic property of the parity check matrix of QC-LDPC codes, the size of key can be efficiently reduced, and compared with the traditional approach of signature-then encryption, the ciphertext is 25% less. And the computational efficiency is high than the signcryption based on number theory such as “Two birds one stone”. Security analyse show that it satisfies IND-CCA2 and EUF-CMA security under random oracle model.

Key words: signcryption, post-quantum cryptography, code-based cryptography, QC-LDPC, provably secure

中图分类号:

TP309

刘明烨, 韩益亮, 杨晓元. 基于准循环低密度奇偶校验码的签密方案研究[J]. 信息网络安全, 2016, 16(11): 66-72.

Mingye LIU, Yiliang HAN, Xiaoyuan YANG. Research of Signcyption Based on QC-LDC[J]. Netinfo Security, 2016, 16(11): 66-72.

图/表 2

参考文献 18

[1]	叶伟伟,欧庆于,柏小武. 基于服务架构的密码服务系统认证方案研究[J]. 信息网络安全,2016(5):37-43.
[2]	ZHENG Y.Digital Signcryption or how to Achieve Cost (signature& encryption) Cost (signature)+ Cost (encryption)[M].Lecture Notes in Computer Science. Heidelberg: Springer-Berlin, 1999.
[3]	RIVEST R L, SHAMIR A, ADLEMAN L.A Method for Obtaining Digital Signatures and Public-key Cryptosystems[J]. Communications of the ACM, 1978, 21(2): 120-126.
[4]	Steinfeld R, Zheng Y.A Signcryption Scheme Based on Integer Factorization[C]//ISW .International Workshop on Information Security ISW 2000, December 20-21, 2000, Wollongong, Australia. Heidelberg: Springer-Berlin, 2000: 308-322.
[5]	MALONELEE J,MAO W.Two Birds one Stone: Signcryption Using RSA[M].Topics in Cryptology-CT-RSA 2003,Berlin Heidelberg:Springer, 2003.
[6]	BOYEN X.Multipurpose Identity-Based Signcryption - A Swiss Army Knife for Identity-Based Cryptography[M] Advances in Cryptology - CRYPTO 2003. Heidelberg: Springer-Berlin, 2003.
[7]	CHEN L, MALONELEE J.Improved Identity-based Signcryption[C]//IACR.15th IACR International Conference on Practice and Theory of Public-Key Cryptography,May 21-23, 2012,Darmstadt, Germany.Berlin Heidelberg:Springer, 2005: 362-379.
[8]	SHOR P W.Polynomial-time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer[J]. SIAM Review, 1999, 41(2): 303-332.
[9]	BERLEKAMP E R, MCELIECE R J, VAN T H C A. On the Inherent Intractability of Certain Coding Problems[J]. IEEE Transactions on Information Theory, 1978, 24(3): 384-386.
[10]	MCELIECE R J. A Public-Key Cryptosystem Based on Algebraic Coding Theory[EB/OL]. , 2016-1-15.
[11]	BALDI M.QC-LDPC Code-Based Cryptosystems[M].QC-LDPC Code-Based Cryptography. Heidelberg: Springer-Berlin, 2014.
[12]	NIEDERREITER H.Knapsack-type Cryptosystems and Algebraic Coding Theory[J]. Problems Control Inform Theory, 1986, 15(2):159-166.
[13]	BALDI M, CHIARALUCE F, GARELLO R, et al.Quasi-cyclic Low-density Parity-check Codes in the McEliece Cryptosystem[C]//IEEE.The IEEE International Conference on Communications 2007- ICC-2007, June 24-28, 2007, Glasgow, Scotland.New York:IEEE, 2007: 951-956.
[14]	WANG Y. Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE[EB/OL]., 2016-1-15.
[15]	COURTOIS N T, FINIASZ M, SENDRIER N.How to Achieve a McEliece-based Digital Signature Scheme[M]//ASIACRYPT 2001: Advances in Cryptology-ASIACRYPT 2001. Heidelberg: Springer-Berlin, 2001.
[16]	BALDI M, BIANCHI M, CHIARALUCE F, et al.Using LDGM codes and sparse syndromes to achieve digital signatures[M].Post-Quantum Cryptography. Heidelberg: Springer-Berlin, 2013.
[17]	TOWNSEND R, WELDON E.Self-orthogonal Quasi-cyclic Codes[J]. IEEE Transactions on Information Theory, 1967, 13(2): 183-195.
[18]	陆思奇,范书珲,韩旭,等. 一种基于CAFL模型的抗弹性泄露密钥交换协议研究[J]. 信息网络安全,2016(4):31-37.

基于准循环低密度奇偶校验码的签密方案研究

Research of Signcyption Based on QC-LDC

RichHTML

可视化

摘要/Abstract

引用本文

使用本文

图/表 2

参考文献 18

相关文章 15

编辑推荐

Metrics

本文评价

[1]	胡荣磊, 李文敬, 蒋华, 张昕然. 基于离散对数的无证书聚合签密方案[J]. 信息网络安全, 2019, 19(7): 42-49.
[2]	张玉磊, 骆广萍, 王欢, 刘祥震. 5G网络下可证安全的TPKC-CLPKC异构混合签密方案[J]. 信息网络安全, 2019, 19(5): 30-37.
[3]	曹素珍, 郎晓丽, 刘祥震, 王斐. 5G网络下新的异构签密方案[J]. 信息网络安全, 2018, 18(11): 33-39.
[4]	杜庆灵. 基于身份的动态群通信签密方案[J]. 信息网络安全, 2017, 17(9): 42-44.
[5]	周凯, 彭长根, 何建琼, 王亚伟. 可证明安全的LBS中连续查询的轨迹隐私保护方案[J]. 信息网络安全, 2017, 17(1): 43-47.
[6]	仇各各, 汪学明, 张言胜. 基于HECC的WSN身份认证协议研究[J]. 信息网络安全, 2015, 15(12): 54-58.
[7]	赵洋, 岳峰, 熊虎, 秦志光. 一种强指定验证者环签名和签密体制[J]. 信息网络安全, 2015, 15(10): 8-13.
[8]	. 基于分组密码的认证加密工作模式[J]. , 2014, 14(11): 8-.
[9]	徐权佐, 蔡庆军. 一种基于编码的公钥密码体制的参数选择研究[J]. 信息网络安全, 2014, 14(10): 54-58.
[10]	项顺伯. 可证安全的基于身份的广义签密方案[J]. , 2013, 13(1): 0-0.
[11]	费向东;潘郁. 安全背包公钥密码的要点和设计[J]. , 2012, 12(9): 0-0.
[12]	刘宇靓;任伟. 基于通用可组合理论的协议安全性证明方法讨论[J]. , 2012, 12(6): 0-0.
[13]	任伟. 公钥密码体制的基本原理研究[J]. , 2011, 11(5): 0-0.
[14]	李发根;钟笛. 数字签密综述[J]. , 2011, 11(12): 0-0.
[15]	任伟. 可证明安全公钥密码学探究[J]. , 2011, 11(11): 0-0.