A Probabilistic Computing Approach to the Closest Vector Problem for Lattice-Based Factoring

Max O. Al-Hasso, Marko von der Leyen

The closest vector problem (CVP) is a fundamental optimization problem in lattice-based cryptography and its conjectured hardness underpins the security of lattice-based cryptosyst…