Paper 2025/1471
NTWR Prime - redundant security based on NTRU Prime and LWR problems
, Jagiellonian University, AGH University of KrakowAbstract
In this article, we introduce a new post-quantum cryptosystem, NTWR Prime, which is based on the NTRU Prime and Learning With Rounding (LWR) problems. This scheme is inspired by the NTWE construction proposed by Joel Gartner in 2023. Unlike NTWE, our algorithm employs an irreducible, non-cyclotomic polynomial whose Galois group is isomorphic to the symmetric group. Additionally, the LWR problem is used in place of the LWE problem, offering potential advantages for structural security due to its deterministic nature. We conduct a security analysis demonstrating that solving the NTWR Prime problem requires solving both the underlying NTRU Prime and LWR problems. Consequently, given the absence of definitive post-quantum security proofs for these problems, our construction offers redundancy, which may fulfill the requirements of applications with exceptionally high security standards. Importantly, we show that there exists a set of parameters satisfying the hardness assumptions for both contributing problems.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- PQCNTRU PrimeLWR
- Contact author(s)
-
jakub mielczarek @ uj edu pl
mzajecka @ agh edu pl - History
- 2025-08-14: approved
- 2025-08-13: received
- See all versions
- Short URL
- https://ia.cr/2025/1471
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1471,
author = {Jakub Mielczarek and Małgorzata Zajęcka},
title = {{NTWR} Prime - redundant security based on {NTRU} Prime and {LWR} problems},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1471},
year = {2025},
url = {https://eprint.iacr.org/2025/1471}
}
