Completed2025Author
ContractEncrypt
Lattice and ECC encryption under simulated quantum attack
Implement both schemes from the primitives, then attack them, because the interesting question is not which is faster but which assumption survives.
Problem
Post-quantum arguments are usually read rather than run. Implementing both schemes and simulating the attack makes the difference concrete: one hardness assumption has a known quantum algorithm against it and the other does not.
What I built
Both schemes, a benchmark, and the attack.
- LWE-based lattice encryption implemented from the primitives
- P-256 ECDH with AES-CBC as the classical comparison
- Benchmarks on encryption and decryption speed, ciphertext size, Shannon entropy and bit-flip resilience
- Quantum attack circuits simulated in Qiskit and Qiskit-Aer against both schemes
Limitations and failure modes
- Simulated circuits on a classical machine. This demonstrates the structure of the attack, not its practicality at scale.
- Implemented from primitives for study. Not hardened, not constant-time, and not for production use.
Attribution
- Built by me
- Both implementations, the benchmark and the attack simulation.
- Based on external research
- LWE, ECDH and the quantum algorithms are established work.