2 papers
cs.CC2025
Lattice Based Crypto breaks in a Superposition of Spacetimes
Divesh Aggarwal, Shashwat Agrawal, Rajendra Kumar
We explore the computational implications of a superposition of spacetimes, a phenomenon hypothesized in quantum gravity theories. This was initiated by Shmueli (2024) where the au…
cs.DS2025
On Beating for the Closest Vector Problem
Amir Abboud, Rajendra Kumar
The Closest Vector Problem (CVP) is a computational problem in lattices that is central to modern cryptography. The study of its fine-grained complexity has gained momentum in the…