pqc-assay
Thriving Thriving C C IS
↑ 50 ?
pqc-assay amarshat/pqc-assay

Reproducible refinement proof for unmodified PQClean ML-DSA reference C (reduce.c + forward NTT): fixed-width C -> Cryptol -> Isabelle -> FIPS 204, via a SAW + Cryptol + Isabelle pipeline.

https://amarshat.github.io/pqc-assay/ ↗
HEALTH ? 79 / Stable
// solo builder// hidden gem cryptographycryptoldilithiumfips-204formal-methodsformal-verificationisabelleml-dsapost-quantum-cryptographypqclean ?

// momentum

+0★ · 0 issues · 2w

// why it's here

  • Active: last commit today
  • Built almost entirely by one person
  • Health 79/100 with only 5 stars

// how to help

// readme

PQC-Assay machine-checks unmodified post-quantum reference C against specifications written from the standards. SAW proves the C equal to a Cryptol model, Galois’s cryptol-to-isabelle lifts that model into Isabelle, and Isabelle proves the lifted model equal to the mathematics. It is the toolchain Apple used for its 2026 corecrypto work; none of Apple’s code or theories are used here.

There are two targets. The first is ML-DSA-44 (FIPS 204) in PQClean’s reference C. The chain reaches from the C functions to ring arithmetic in R_q = Z_q[X]/(X^256+1), and sign.c is proved to compose those functions. Apple’s corecrypto proofs already cover ML-DSA signing end to end on Apple’s code: their loop proof covers every iteration up to a counter bound, and they verify Keccak and the samplers, which are assumed here. So this repo’s ML-DSA work is an independent check of a different code base, not a first. The second target, and the current main line, is HQC (selected by NIST in 2025), starting with its reference polynomial multiplication.

Read the full README on GitHub ↗