Cryptology ePrint Archive: Report 2015/549

ILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices

Amir Hassani Karbasi, Reza Ebrahimi Atani

Abstract: 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 proves for our main system from the already proven hardness of the R-LWE and R-SIS problems.

Category / Keywords: foundations / lattice techniques

Original Publication (with minor differences): The Seventh International Symposium on Telecommunications (IST 2014), September 2014.

Date: received 4 Jun 2015

Contact author: reza ebrahimi atani at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20150608:213255 (All versions of this report)

Short URL: ia.cr/2015/549

Discussion forum: Show discussion | Start new discussion