Computer Science ›› 2019, Vol. 46 ›› Issue (6): 162-167.doi: 10.11896/j.issn.1002-137X.2019.06.024

Previous Articles     Next Articles

Digital Signature Algorithm Based on QC-LDPC Code

YANG Xue-fei, ZHENG Dong, REN Fang   

  1. (School of Telecommunication and Information Engineering,Xi’an University of Posts and Telecommunications,Xi’an 710121,China)
    (National Engineering Laboratory for Wireless Security,Xi’an University of Posts and Telecommunications,Xi’an 710121,China)
  • Received:2018-04-08 Published:2019-06-24

Abstract: Code-based public key cryptography can resist the attack of quantum algorithms.Aiming at the large amount of key in classical CFS signature scheme,this paper proposed a kind of CFS signature scheme based on QC-LDPC codes.This scheme improves the traditional CFS signature scheme based on QC-LDPC codes.The BP fast decoding algorithm of QC-LDPC codes is used in the signature process.The analysis shows that the new scheme can reduce the key storage space of CFS,improve the efficiency of signature,and effectively resist the attack of quantum algorithm without reducing the security.

Key words: BP decoding algorithm, CFS signature scheme, Public key cryptography, QC-LDPC codes

CLC Number: 

  • TP309
[1]SHOR P W.Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.Siam Review,1997,41(2):1484-1509.
[2]BERNSTEIN D J.Introduction to post-quantum cryptography[J].Post Quantum Cryptography,2009,85(1-2):1-14.
[3]MCELIECE R J.A Public-Key Cryptosystem Based on Algebraic Coding Theory[J].Deep Space Network Progress Report,1978,42(44):114-116.
[4]NIEDERREITER H.Knapsack-type cryptosystems and algebraic coding theory[J].Problems Control Inform Theory,1986,15(2):159-166.
[5]COURTOIS N,FINIASZ M,SENDRIER N.How to Achieve a McEliece-Based Digital Signature Scheme[C]∥Advances in Cryptology- ASIACRYPT 2001,International Conference on the Theory and Application of Cryptology and Information Security.Australia:DBLP,2006:157-174.
[6]GALLAGER R G.Low-density parity-check codes[J].Information Theory Ire Transactions on,1960,8(1):21-28.
[7]MACKAY D J C,NEAL R M.Near Shannon limit performance of low density parity check codes[J].Electronics Letters,1996,33(6):457-458.
[8]BALDI M,CHIARALUCE F,GARELLO R,et al.Quasi-Cyclic Low-Density Parity-Check Codes in the McEliece Cryptosystem[C]∥IEEE International Conference on Communications.IEEE,2007:951-956.
[9]BLAZY O,GABORIT P,SCHREK J,et al.A code-based blind signature[C]∥IEEE International Symposium on Information Theory.IEEE,2017:2718-2722.
[10]CHEN S,ZENG P,CHOO K K R,et al.Efficient Ring Signature and Group Signature Schemes Based on q-ary Identification Protocols[J].Computer Journal,2018,61(4):545-560.
[11]LING S,NGUYEN K,ROUX-LANGLOIS A,et al.A lattice-based group signature scheme with verifier-local revocation [J].Theoretical Computer Science,2018,730(19):1-20.
[12]REN F,ZHENG D,FAN J L.Survey of Digital Signature Technology based on Error Correcting Codes[J].Chinese Journal of Network and Information Security,2016,2(11):1-10.(in Chinese)
[13]DRAGOI V,KALACHI H T.Cryptanalysis of a public key encryption scheme based on QC-LDPC and QC-MDPC codes[J].IEEE Communications Letters,2017,PP(99):264-267.
[14]BALDI M.QC-LDPC Code-Based Cryptosystems[M]∥QC-LDPC Code-Based Cryptography.Springer International Publishing,2014:91-117.
[15]ZHANG X R,LI,J P,CAI C S.A Novel LLR-BP Algorithm for LDPC Codes Based on Taylor Series and Least Squares[J].Applied Mechanics & Materials,2014,462-463:193-197.
[16]REN F,ZHENG D,WANG W J.An Efficient Code Based Digi-tal Signature Algorithm[J].IJ Network Security,2017,19(6):1072-1079.
[17]FINIASZ M,SENDRIER N.SECUrity Bounds for the Design of Code-Based Cryptosystems[C]∥Advances in Cryptology- ASIACRYPT 2009,International Conference on the Theory and Application of Cryptology and Information Security.Tokyo:DBLP,2009:88-105.
[18]VAMBOL A,KHARCHENKO V,POTII O,et al.McEliece and Niederreiter Cryptosystems Analysis in the Context of Post-Quantum Network Security[C]∥International Conference on Mathematics & Computers in Sciences & in Industry.IEEE Computer Society,2017:134-137.
[19]STERN J.A method for finding codewords of small weight[C]∥ International Colloquium on Coding Theory and Applications.New York:Springer-Verlag,1989:106-113.
[20]HIROTOMO M,MOHRI M,MORII M.A probabilistic computation method for the weight distribution of low-density parity-check codes[C]∥International Symposium on Information Theo-ry.IEEE,2005:2166-2170.
[1] ZHANG Yi-chen, LI Ji-guo and QIAN Na. Certificateless Strong Designated Verifier Signature Scheme [J]. Computer Science, 2015, 42(3): 132-135.
[2] REN Fang and ZHENG Dong. Efficient and Secure Communication Scheme for Deep Space Networks [J]. Computer Science, 2015, 42(12): 229-232.
[3] WEI Yun,WEI Fu-shan and MA Chuan-gui. Non-interactive Key Exchange Protocol Based on Certificateless Public Key Cryptography [J]. Computer Science, 2014, 41(12): 101-106.
[4] SUN Hua and MENG Kun. Efficient Certificateless Ring Signcryption Scheme [J]. Computer Science, 2014, 41(11): 208-211.
[5] LIU Qing-hua,SONG Yu-qing and LIU Yi. Efficient Content Extraction Signature Scheme without Certification [J]. Computer Science, 2013, 40(8): 136-139.
[6] . Research on General Wireless Authentication Protocol Based on PKI [J]. Computer Science, 2012, 39(7): 74-77.
[7] . Non-interactive and Non-malleable Commitment Scheme Based on Lattice [J]. Computer Science, 2012, 39(4): 63-66.
[8] LIU Zhen-hua, HU Yu-pu, ZHANG Xiang-song. Chosen Ciphertext Secure Identity-based Encryption in the Standard Model [J]. Computer Science, 2009, 36(10): 64-67.
[9] TANG Xue-Ming, HONG Fan, CUI Cuo-Hua, WANG Xiao-Fei (College of Computer Science, Huazhong University of Science and Technology, Wuhan 430074). [J]. Computer Science, 2006, 33(8): 121-125.
Full text



No Suggested Reading articles found!