Shortest Vector Problems in Ideal Lattices and the Hardness of Ring Learning with Errors
Abstract
A rigorous derivation of quantum reductions for ideal lattice constraints within the module-theoretic framework of cyclotomic number fields and the asymptotic hardness of algebraic lattice problems.
Fields of Study & Subjects
Cryptography and Data Security
Quantum Computing Algorithms and Architecture
Complexity and Algorithms in Graphs
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 4 January 2026