<aside> ✅
Research Proposal
</aside>
Abstract:
The quantum computing poses a challenge to classical public-key cryptosystems such as RSA and ECC. Lattice cryptography, particularly those relying on structured lattices such as ring and module lattices, represents a leading candidate for post-quantum security. Yet, despite its theoretical robustness, practical deployment remains constrained by computational cost, basis reduction complexity, and large key sizes.
This project seeks to bridge the gap between theoretical lattice cryptography and practical implementation through an open-source experimental framework. By iteratively developing and benchmarking core lattice algorithms, we aim to quantify computational tradeoffs in lattice reduction, key generation, and encryption-decryption efficiency. The toolkit currently includes:
・ver1.0: Ideal Lattice Builder — construction tools for ring-based lattices
・ver1.1: Base Vector Reduction Algorithm — implementation of classical reduction methods
・ver1.2: KZ (Korkine–Zolotarev) Reduction Algorithm — advanced reduction for comparative benchmarking
Building on these stages, we will measure solver performance using public challenges such as the Lattice Challenge, focusing on scalability with lattice dimension, runtime complexity, and numerical stability. Results will be released as open data and published in preprints, contributing both empirical baselines and reproducible code for the community.
Our ultimate objective is to derive practical insights into the computational effort at world-record scales of lattice reduction, informing the next generation of post-quantum cryptographic systems. By combining open-source development, we hope to enable both researchers and practitioners to explore balances between usability and security.
<aside> ✅
Development
</aside>
Quantum computing is coming fast — and with it, the end of classical encryption as we know it. Lattice-based cryptography is one of the most promising directions for post-quantum security: mathematically elegant, brutally hard to break, and theoretically sound. But turning that theory into practical, efficient, real-world systems is still an open problem.
That’s where this project comes in.
We’re an open-source research effort experimenting with lattice construction, basis reduction, and solver development, with a focus on reproducibility, transparency, and exploration. Our goal is to help both researchers and developers get a “hands-on” understanding of what it takes to build and attack real lattices — and to measure how far current algorithms can actually go.
・ver1.0 – Ideal Lattice Builder: Tools for constructing ring-based lattices