JISE


  [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ]


Journal of Information Science and Engineering, Vol. 35 No. 5, pp. 1061-1074


A QC-LDPC Code Based Digital Signature Algorithm


FANG REN1, XUE-FEI YANG1 AND DONG ZHENG2
1School of Telecommunication and Information Engineering
2National Engineering Laboratory for Wireless Security
Xi'an University of Posts and Telecommunications
Xi'an, 710121 P.R. China
E-mail: renfang_81@163.com; 451173933@qq.com;
zhengdong@xupt.edu.cn


Courtois-Finiasz-Sendrier (CFS) digital signature algorithm, which proposed in 2001, is the most important code based digital signature algorithm and can resist the known attack of quantum algorithms such as Shor algorithm and Grover algorithm. But the efficiency of CFS is very low because of the extremely low signing speed and the large public key size. In this paper, a variation of CFS algorithm is presented. Instead of the Goppa code and the Patterson decoding algorithm, the new algorithm selects the Quasi-Cyclic Low Density Parity Check (QC-LDPC) code and the Belief Propagation (BP) decoding algorithm in the signing process. Compared with CFS algorithm, the new algorithm greatly reduces the storage space of public key and improves the efficiency of signature without compromising the security.


Keywords: code based cryptography, digital signature, QC-LDPC code, decoding algorithm, CFS algorithm

  Retrieve PDF document (JISE_201905_08.pdf)