Comparative Analysis of Iterative Decoding Algorithms for QC-MDPC McEliece Cryptosystems

Abstract

QC-MDPC McEliece cryptosystems are a promising candidate for post-quantum cryptography due to their resistance to quantum attacks. However, the performance of these cryptosystems is heavily reliant on the decoding algorithms used for decryption. In this paper, we give a comparative analysis of iterative decoding algorithms for QC-MDPC McEliece cryptosystems. Specifically, we compare different iterative decoders bit-flipping, black-gray flip decoder with the backflip decoder. We evaluate the performance of each algorithm in terms of decoding failure rate, average number of iterations and running time. Our experimental results demonstrate that the choice of iterative decoding algorithm significantly impacts the efficiency of QC-MDPC McEliece cryptosystems. We identify the most efficient decoding algorithm based on the experimental results and discuss the implications of our findings on the practical use of QC-MDPC McEliece cryptosystems in post-quantum cryptography.