- 期刊
- OpenAccess
A QC-LDPC Code Based Digital Signature Algorithm
摘要
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.
延伸閱讀
- 楊政哲（2015）。Constructions of QC-LDPC Code Based on Masking and PDF〔碩士論文，國立清華大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0016-0508201514085394
- Leong, C. Y. (2010). An Efficient Layered Decoding Architecture Using Selective Algorithm for Non-Binary QC-LDPC Codes [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-1901201111415012
- 許恭睿（2008）。Low Complexity Decoding Algorithm of LDPC Codes—The Combined Decoding Algorithm〔碩士論文，國立中央大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0031-0207200917354343
- 林宗億（2009）。On Min-Sum Algorithm and Its Variants for Decoding of LDPC Codes〔碩士論文，國立臺北大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0023-0909200912211400
- Chen, T. C. (2011). An Adaptive Algorithm and Stopping Criterion for LDPC Decoding. 中華科技大學學報, (48), 101-120. https://doi.org/10.7095/JCUST.201107.0101