ILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices (ILTRU: An NTRU-Like Lattice-based Cryptosystem)
Paper ID : 1732-IST
Reza Ebrahimi Atani *, Amir Hassani Karbasi
University of Guilan
In this paper we present a new NTRU-Like public key cryptosystem with security provably based on the worst case hardness of the approximate both Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) in some structured lattices, called ideal lattices. We show how to modify the ETRU cryptosystem, an NTRU-Like public key cryptosystem based on the Eisenstein integers where is a primitive cube root of unity, to make it provably secure, under the assumed quantum hardness of standard worst-case lattice problems, restricted to a family of lattices related to some cyclotomic fields. The security then follows from the already proven hardness of the R-LWE problem.