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.
Original language | English |
---|---|
Pages (from-to) | 2154-2160 |
Number of pages | 7 |
Journal | Journal of Korean Institute of Communications and Information Sciences |
Volume | 45 |
Issue number | 12 |
DOIs | |
State | Published - Dec 2020 |
Keywords
- Berlekamp-Massey algorithm
- binary Goppa code
- Code-based Cryptography
- McEliece cryptosystem
- Patterson algorithm