Research of Signcyption Based on QC-LDC

doi:10.3969/j.issn.1671-1122.2016.11.011

Abstract

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

CLC Number:

TP309

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

Figures/Tables 2

References 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.