Implementation of the fastest ISD algorithms
-
Updated
Feb 21, 2025 - C++
Implementation of the fastest ISD algorithms
An implementation of Dumer's algorithm for Information Set Decoding.
An implementation of a few QC-MDPC decoding algorithms.
Post-quantum cryptographic implementation of HQC (Hamming Quasi-Cyclic) - a NIST PQC candidate for quantum-resistant key encapsulation using code-based cryptography
Circuital implementation of a Quantum Random Walk on a Johnson graph using qiskit
Markovian modeling of a QC-MDPC decoding algorithm.
An implementation of the Backflip QC-MDPC decoder.
Markovian modeling of a QC-MDPC decoding algorithm that accounts for near codewords.
Achieving security against fuzzing and improving bandwidth efficiency by combining FEC and symmetric encryption.
Scripts showing vulnerabilities in enhanced pqsigRM.
An rough implementation of Sieving-Style ISD
An implementation of the IND-CCA adaptation of Loidreau's public key encryption scheme presented in Shehhi et al. (https://eprint.iacr.org/2019/1278)
Add a description, image, and links to the code-based-cryptography topic page so that developers can more easily learn about it.
To associate your repository with the code-based-cryptography topic, visit your repo's landing page and select "manage topics."