Paper 2026/650
A Search-to-Decision Reduction for Continuous LWE
Abstract
We give a search-to-decision reduction for the continuous version of the LWE problem, CLWE (Bruna, Regev, Song and Tang, STOC 2021). In 2022, Gupte, Vafa, and Vaikuntanathan showed a classical reduction from CLWE to LWE and discrete-CLWE (secret from a discrete set) to LWE. However, since the reverse reduction of CLWE to LWE was only for discrete-CLWE, there is no search-to-decision reduction for general CLWE. We now give a relatively simple algorithm, that approximates the secret vector to within a small error. Showing the decision oracle to be powerful enough to solve the search version of the CLWE problem.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Contact author(s)
- kirpa @ prince ac
- History
- 2026-04-06: approved
- 2026-04-03: received
- See all versions
- Short URL
- https://ia.cr/2026/650
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/650,
author = {Kirpa Prince},
title = {A Search-to-Decision Reduction for Continuous {LWE}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/650},
year = {2026},
url = {https://eprint.iacr.org/2026/650}
}
