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.
Quantum circuits for ISD using Grover
Circuital implementation of a Quantum Random Walk on a Johnson graph using qiskit
An rough implementation of Sieving-Style ISD
Browser-based code-based cryptanalysis demo — Hint-ISD, eprint 2026/341. Decode a real syndrome with information-set decoding, feed it leaked hints one at a time, then watch the work factor fall from exponential toward polynomial. Real GF(2) arithmetic. No backend.
This repository contains my thesis work. The aim was to integrate parallelization for the existing ISD algorithms into the CryptAttackTester framework.
Browser demo of the first cache-timing full-decryption oracle attack on post-quantum HQC (Dong & Guo, IACR 2026/693) — showing how Clang -O3 silently rewrites constant-time Reed-Muller decoding into secret-dependent branches. Real HQC math, deterministic leak model, Soft-ISD key recovery.
Add a description, image, and links to the information-set-decoding topic page so that developers can more easily learn about it.
To associate your repository with the information-set-decoding topic, visit your repo's landing page and select "manage topics."