Explore quantum-resistant zero-knowledge cryptographic proofs with Plonky2. This project implements a prover/verifier pair for a recursive computation chain, ensuring computational integrity across large-scale hashing operations. Featuring recursive proof compression for efficient scaling, it demonstrates advanced circuit design and recursive hash verification.
A pure Rust, no-std implementation of FIPS 203 (Draft) that explores module learning-with-errors (ML-KEM-768) for post-quantum key exchange. Designed with a focus on academic experimentation, this library represents cutting-edge cryptographic research.
By pairing ML-KEM-768 with a SHA-3 sponge construction, this project provides a theoretical quantum-safe public-key cryptosystem for high-performance encryption and decryption. A work in progress, this implementation predates Rust's standardization of ML-KEM—because we did it before it was cool. 😉
Use at your own risk: this library is unaudited, non-standard, and purely for academic curiosity. If you enjoy living on the edge of cryptographic innovation, give it a try!