Decoding Algorithms for LDPC Code-Based Post Quantum Cryptosystems 


Vol. 45,  No. 12, pp. 2037-2045, Dec.  2020
10.7840/kics.2020.45.12.2037


PDF Full-Text
  Abstract

The emergence of practical quantum computers poses a significant threat to the most popular public key cryptosystems in current use. In order to cope with this problem, NIST has been standardizing post-quantum cryptography algorithms since 2017. The LDPC code, which is widely used as a representative error correction code for communication systems, has been proposed as a code to be applied to the code-based cryptography in BIKE and LEDAcrypt, two candidates for NIST standardization. In code-based cryptosystems, decoding performance is significant because it determines the security level of the cryptosystems. In this paper, we introduce the proposed decoding techniques in the LDPC code-based post quantum cryptosystems to prepare for the upcoming quantum computing era.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Kim, "Decoding Algorithms for LDPC Code-Based Post Quantum Cryptosystems," The Journal of Korean Institute of Communications and Information Sciences, vol. 45, no. 12, pp. 2037-2045, 2020. DOI: 10.7840/kics.2020.45.12.2037.

[ACM Style]

Junghyun Kim. 2020. Decoding Algorithms for LDPC Code-Based Post Quantum Cryptosystems. The Journal of Korean Institute of Communications and Information Sciences, 45, 12, (2020), 2037-2045. DOI: 10.7840/kics.2020.45.12.2037.

[KICS Style]

Junghyun Kim, "Decoding Algorithms for LDPC Code-Based Post Quantum Cryptosystems," The Journal of Korean Institute of Communications and Information Sciences, vol. 45, no. 12, pp. 2037-2045, 12. 2020. (https://doi.org/10.7840/kics.2020.45.12.2037)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880