Paper 2026/1829 Original: eprint.iacr.org/2026/1829 ↗
Decomposed LWE is Equivalent to Succinct LWE
Abstract
We prove that the Succinct Learning with Errors assumption, introduced by Wee (CRYPTO '24), and the Decomposed Learning with Errors assumption, introduced by Abram, Malavolta, and Roy (CRYPTO '25), are equivalent under appropriate parameter settings. Abram, Malavolta, and Roy proved that Succinct LWE implies Decomposed LWE. We establish the converse implication, showing that Decomposed LWE implies Succinct LWE.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2026-10-14: last updated
- 2026-08-28: published
- Short URL
- https://ia.cr/2026/1829
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2026/1829,
author = {Damiano Abram and Gal Arnon and Valerio Cini and Paul Lou and Giulio Malavolta and Lawrence Roy},
title = {Decomposed LWE is Equivalent to Succinct LWE},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1829},
year = {2026},
url = {https://eprint.iacr.org/2026/1829}
}