QTRU: A Lattice Attack Resistant Version of NTRU

Ehsan Malekian; Ali Zakerolhosseini; Atefeh Mashatan

Paper 2009/386

QTRU: A Lattice Attack Resistant Version of NTRU

Ehsan Malekian, Ali Zakerolhosseini, and Atefeh Mashatan

Abstract

We propose QTRU, a probabilistic and multi-dimensional public key cryptosystem based on the NTRU public key cryptosystem using quaternion algebra. QTRU encrypts four data vectors in each encryption session and the only other major di®erence between NTRU and QTRU is that the underlying algebraic structure has been changed to a non-commutative algebraic structure. As a result, QTRU inherits the strength of NTRU and its positive points. In addition, the non commutativity of the underlying structure of QTRU makes it much more resistant to some lattice-based attacks. After a brief description of NRTU, we begin by describing the algebraic structure used in QTRU. Further, we present the details of the key generation, encryption and decryption algorithms of QTRU and discuss the issues regarding key security, message security, and probability of successful decryption. Last but not least, QTRU's resistance against lattice-based attacks is investigated.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: QTRU NTRU quaternion algebra public key cryptography encryption
Contact author(s): a-zaker @ sbu ac ir
History: 2009-08-10: received
Short URL: https://ia.cr/2009/386
License: CC BY

BibTeX

@misc{cryptoeprint:2009/386,
      author = {Ehsan Malekian and Ali Zakerolhosseini and Atefeh Mashatan},
      title = {{QTRU}: A Lattice Attack Resistant Version of {NTRU}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/386},
      year = {2009},
      url = {https://eprint.iacr.org/2009/386}
}