3 papers
cs.CR2026
A Note on Banaszczyk's Inequality
Hongyuan Qu, Chengliang Tian, Guangwu Xu
Banaszczyk's inequality establishes a tail estimate for the discrete Gaussian measure on a lattice in . This classic result has been influential and plays an importan…
cs.CG2025
Algorithms for the Shortest Vector Problem in -dimensional Lattices, Revisited
Lihao Zhao, Chengliang Tian, Jingguo Bi +2
Efficiently solving the Shortest Vector Problem (SVP) in two-dimensional lattices holds practical significance in cryptography and computational geometry. While simpler than its hi…
cs.CR2025
Chinese Remainder Theorem Approach to Montgomery-Type Algorithms
Guangwu Xu, Yiran Jia, Yanze Yang
This paper explores the ability of the Chinese Remainder Theorem formalism to model Montgomery-type algorithms. A derivation of CRT based on Qin's Identity gives Montgomery reducti…