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.
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}
}
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。