Paper 2015/549

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

Amir Hassani Karbasi and 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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Minor revision. The Seventh International Symposium on Telecommunications (IST 2014), September 2014.
Keywords
lattice techniques
Contact author(s)
reza ebrahimi atani @ gmail com
History
2015-06-08: received
Short URL
https://ia.cr/2015/549
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/549,
      author = {Amir Hassani Karbasi and Reza Ebrahimi Atani},
      title = {ILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices},
      howpublished = {Cryptology ePrint Archive, Paper 2015/549},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/549}},
      url = {https://eprint.iacr.org/2015/549}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.