Spring 2020

On the Hardness of the NTRU Problem

Monday, Jun. 14, 2021 8:30 am9:00 am PDT

Add to Calendar


Alice Pellet-Mary (University of Bordeaux)



In this talk, we will describe different variants of the NTRU problem, and study how they compare to each other (and to other more classical lattice problems) in terms of reduction. More precisely, we will show that one of the search variant of the NTRU problem is at least as hard as the shortest vector problem (SVP) in ideal lattices; and that the decisional variant of NTRU is at least as hard as another search variant of NTRU. Unfortunately, the two search variants of NTRU that are considered in these reductions do not match, meaning that we cannot combine the reductions in order to obtain a reduction from the ideal shortest vector problem to the decisional NTRU problem.
This is a joint work with Damien Stehlé.

PDF icon Slides712.19 KB