Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Back to Paper
cs.CRquant-ph

Local ID: 2604.15858v2

AI Summary: gemma4:e4b

Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$

By Ming-Xing Luo

Revision History Timeline

v14/17/2026
4/17/2026

“24 pages”

v25/7/2026
5/7/2026

“24 pages”

★ Version indexed in Explorer

Comparing v1 vs v2

Green = Added • Red = Removed

Title Comparison

Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$

Authors Comparison

No author changes.

v1 Comment

“24 pages”

v2 Comment

“24 pages”

Abstract Word Diff

Weber's conjecture (1886) governs three aspects of lattice-based cryptography: the solvability of the Principal Ideal Problem, the freeness of modules over rings of integers, and the tightness of worst-case-to-average-case reductions in Ring-LWE (R-LWE) and Module-LWE (MLWE). Existing verifications for $k \ge 9$ rely on Generalized Riemann Hypothesis (GRH). In this paper, we present the first unconditional proof for $k \le 12$. Our method combines the Fukuda-Komatsu computational sieve, inductive structure of the cyclotomic $\mathbb{Z}_2$-tower, and Herbrand's theorem.
View Full Version History on arXiv