Implementation of Binary Goppa Code-Based Cryptography 


Vol. 45,  No. 12, pp. 2154-2160, Dec.  2020
10.7840/kics.2020.45.12.2154


PDF
  Abstract

Classic McEliece is among the 3rd round finalists in the Post-Quantum Cryptography(PQC) Competition held by NIST. The submitted algorithm is based on both Niederreiter cryptosystem and the binary Goppa code. In this paper, we have regenerated the McEliece cryptosystem which is a code-based cryptosystem like the Niederreiter cryptosystem. We measure the execution time and analyze the decryption cycles to evaluate the performance of our implementation. We also present a comparative assessment of Patterson and Berlekamp-Massey decoding algorithms based on the number of cycles for each algorithm.

  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]

K. Yu and D. Lim, "Implementation of Binary Goppa Code-Based Cryptography," The Journal of Korean Institute of Communications and Information Sciences, vol. 45, no. 12, pp. 2154-2160, 2020. DOI: 10.7840/kics.2020.45.12.2154.

[ACM Style]

Ki-Soon Yu and Dae-Woon Lim. 2020. Implementation of Binary Goppa Code-Based Cryptography. The Journal of Korean Institute of Communications and Information Sciences, 45, 12, (2020), 2154-2160. DOI: 10.7840/kics.2020.45.12.2154.

[KICS Style]

Ki-Soon Yu and Dae-Woon Lim, "Implementation of Binary Goppa Code-Based Cryptography," The Journal of Korean Institute of Communications and Information Sciences, vol. 45, no. 12, pp. 2154-2160, 12. 2020. (https://doi.org/10.7840/kics.2020.45.12.2154)