article
The McEliece cryptosystem has proven to be a secure and efficient method for protecting sensitive information in communication infrastructure. Among the variants of this cryptosystem, the quasi-cyclic moderate density parity-check (QC-MDPC) McEliece Cryptosystem has received significant attention due to its compact key size. This paper presents a comprehensive survey of the various decoding algorithms used for the QC-MDPC McEliece Cryptosystem. The performance and effectiveness of each algorithm in securing data in the face of quantum computing challenges is thoroughly evaluated. This survey provides valuable insights into the strengths and weaknesses of each decoding algorithm, and offers guidance for future research in the area of code-based cryptography for quantum computing.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1109/iraset57153.2023.10152992
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.