Independent development and formal analysis of post-quantum cryptographic primitives and zero-knowledge proving systems. Focused on zero-dependency, constant-time, and adversarial-resilient implementations from first principles.
- Theoretical Grounding: A novel post-quantum hardness assumption jointly coupling a noisy module-linear relation over Rq = Zq[X]/(X^n + 1) with a sparse multivariate-quadratic constraint P(s) = 0.
- Constructions: Co-designed Fujisaki-Okamoto Key-Encapsulation Mechanism (KEM) and Fiat-Shamir signature scheme sharing a unified ring arithmetic core.
- Implementation & Verification: Optimized constant-time C implementation (~3.9 KB core codebase) with proven Barrett reduction. Byte-for-byte validated against an independent Python reference. Verified clean under Valgrind and compiler sanitizers.
- Architecture: From-scratch, zero-dependency zero-knowledge proving stack implemented in 100% safe Rust. Utilizes binary tower fields, an NTT-friendly prime field, BLAKE3, and an arity-4 FRI polynomial commitment scheme.
- Recursion: Features a post-quantum, hash-folded Incrementally Verifiable Computation (IVC) mechanism.
- Security & Performance: Formally hardened against proof malleability and transcript-poisoning vectors via strict domain separation. Validated through an adversarial test suite covering 970+ hostile vectors (FRI surgery, leaf/node confusion, fold tampering) with zero panics. Prover runtime measures ~6.4s for 2²⁰ rows on a 16-core CPU.
- CA-PQ is a post-quantum cryptography framework that refuses the usual trade-offs. Instead of choosing between battle-tested classical ECDH and larger post-quantum KEMs, it combines both—plus a deterministic chaotic-stream layer—under a single transcript, in a single dependency-free Rust tree where every primitive is hand-written and every claim is tested.
- Two PQ profiles (ML-KEM-768 at NIST level 3, ML-KEM-512 at level 1) feed two hybrid combiners alongside a hand-written X25519 leg.
- The result on commodity hardware: ∼17k PQ encapsulations per second, ∼2.7k hybrid pairs per second, 828–1 148-byte ciphertexts, zero third-party code.
- HypG is a from-scratch post-quantum cryptographic suite written in 100% safe Rust with zero dependencies: a Module-LWE key-encapsulation mechanism, BLAKE3-based hashing, ChaCha20 / keyed-BLAKE3 authenticated encryption (one-shot and streaming), and state-less hash-based signatures.
- The suite is a frozen research prototype (v1.0): every construction is implemented, deterministically tested, adversarially exercised, and fully gated in CI.
- Relation: Zero-dependency proof of knowledge for a ternary witness over R_q = Z_q[X]/(X^64+1).
- Wire Size: Fixed-by-type footprint of 4,577 Bytes.
- Performance: Sub-millisecond execution (Prover p50 = 184 μs, Verifier p50 = 80 μs).
- Hardening: Validated via 49 million fuzz runs and an exhaustive 36,616-bitflip red-team sweep (100% rejected).
- Assurance: Strict no_std, zero-dependency safe Rust with a complete green Miri sweep.
Contributions to support independent, self-funded cryptographic research are accepted at the following sovereign addresses:
- Ethereum (ETH / ERC-20):
0xAE0ac3296f7b6DDc5921913DbdC5c80E119a1DC3 - Bitcoin (BTC):
bc1qvd7yz2n7nnjumrygr0q77cr589sf6ztp6erl85