On the hardness of the NTRU problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

On the hardness of the NTRU problem

Abstract

The 25 year-old NTRU problem is an important computational assumption in public-key cryptography. However, from a reduction perspective, its relative hardness compared to other problems on Euclidean lattices is not well-understood. Its decision version reduces to the search Ring-LWE problem, but this only provides a hardness upper bound. We provide two answers to the long-standing open problem of providing reduction-based evidence of the hardness of the NTRU problem. First, we reduce the worst-case approximate Shortest Vector Problem over ideal lattices to an average-case search variant of the NTRU problem. Second, we reduce another average-case search variant of the NTRU problem to the decision NTRU problem.
No file

Dates and versions

hal-03348022 , version 1 (18-10-2022)

Identifiers

Cite

Alice Pellet-Mary, Damien Stehlé. On the hardness of the NTRU problem. Asiacrypt 2021 - 27th Annual International Conference on the Theory and Applications of Cryptology and Information Security, Dec 2021, Singapore, Singapore. ⟨10.1007/978-3-030-92062-3_1⟩. ⟨hal-03348022⟩
87 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More