Can Plantard arithmetic plus a code generator make a faster verified NTT, or just a fancier proof chain?
trending4
01 02 Algorithmic Optimization of the Gaussian Sampler in the FN-DSA Post-Quantum Signature Scheme eprint.iacr.orgThe hot PQS bottleneck is exp() approximation, and this paper benchmarks polynomial hacks for Falcon's Gaussian sampler.03 Need post-quantum signatures in Zig? This is a pure-Zig SLH-DSA (FIPS 205) writeup with ACVP, CT tests, and benchmarks.04 Granite: A Modular Methodology for Foundational Verification of Hardware-Software Leakage Contracts arxiv.orgGranite is a paper on modular leakage-contract proofs for RTL CPUs, with speculation and interrupts, because side channels were too easy.