Paper 2026/421 Original: eprint.iacr.org/2026/421 ↗
Cryptanalysis of Polynomial Learning With Errors (PLWE): A Survey
Abstract
Lattice-based cryptography (LBC) has emerged as one of the most promising fields supporting post-quantum cryptography (PQC). The Learning With Errors (LWE) problem \cite{Regev}, due to its strong security guarantees, plays a fundamental role in LBC, although it is not very efficient for cryptographic applications. To address this limitation, several variants of LWE have been developed, such as Ring-LWE (RLWE) \cite{LPR2010}, which is suitable for theoretical purposes, and Polynomial-LWE (PLWE) \cite{BV}, which is more practical. This survey provides a systematic review of vulnerable instances of PLWE. These attacks may extend to RLWE in instances where the two problems are equivalent.. This paper serves as a resource for those seeking a structured overview of the state-of-the-art attacks on PLWE.
Metadata
- Available format(s)
PDF- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- History
- 2026-03-11: last updated
- 2026-03-02: published
- Short URL
- https://ia.cr/2026/421
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2026/421,
author = {Rahinatou Yuh Njah Nchiwo},
title = {Cryptanalysis of Polynomial Learning With Errors (PLWE): A Survey},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/421},
year = {2026},
url = {https://eprint.iacr.org/2026/421}
}