CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

Enhancing the NTRU Cryptosystem

by Awnon Bhowmik, Unnikrishnan Menon
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 176 - Number 29
Year of Publication: 2020
Authors: Awnon Bhowmik, Unnikrishnan Menon

Awnon Bhowmik, Unnikrishnan Menon . Enhancing the NTRU Cryptosystem. International Journal of Computer Applications. 176, 29 ( Jun 2020), 46-53. DOI=10.5120/ijca2020920320

@article{ 10.5120/ijca2020920320,
author = { Awnon Bhowmik, Unnikrishnan Menon },
title = { Enhancing the NTRU Cryptosystem },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2020 },
volume = { 176 },
number = { 29 },
month = { Jun },
year = { 2020 },
issn = { 0975-8887 },
pages = { 46-53 },
numpages = {9},
url = { },
doi = { 10.5120/ijca2020920320 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2024-02-07T00:43:49.774174+05:30
%A Awnon Bhowmik
%A Unnikrishnan Menon
%T Enhancing the NTRU Cryptosystem
%J International Journal of Computer Applications
%@ 0975-8887
%V 176
%N 29
%P 46-53
%D 2020
%I Foundation of Computer Science (FCS), NY, USA

NTRU is an open-source public key cryptosystem that uses lattice-based cryptography to encrypt and decrypt data. Unlike other popular public-key cryptosystems, it is resistant to attacks using Shor's Algorithm and its performance has been shown to be significantly greater. This paper talks about how Koblitz encoding from Elliptic Curve Cryptography (ECC) can be used to convert each character in a dataset to a point on an elliptic curve. A sum of squares analogy is pitted against the cantor pairing function to turn the point to a single number, which is converted to a sequence of coefficients in ℤ. A polynomial is then generated for each of these characters. Then the polynomial is reduced, and then shown that choosing appropriate parameters for the cryptosystem can make it highly secure and that the decryption algorithm turns out taking linear time. Since each character is represented by its own polynomial, it increases obscurity thereby increasing the complexity for decryption and thus the security level. A form of data compression has also been implemented and it has been tested whether data compression and expansion during the encryption-decryption process results in original data with no or minimal loss.

  1. Ajtai, M. (1996). Generating Hard Instances of Lattice Problems. ACM Symposium on Theory of Computing. Philadelphia, Pennsylvania: Association for Computing Machinery. doi:
  2. Brady, R., Davis, N., & Tracy, A. (2010, July). Encrypting with Elliptic Curve Cryptography. Retrieved from
  3. Menon, U., & Bhowmik, A. (2020, March). NTRU Cryptography. Retrieved from
  4. Micciancio, D. (2005). Closest Vector Problem. SpringerLink. doi:
  5. Micciancio, D. (2005). Shortest Vector Problem. SpringerLink. doi:
  6. NTRU. (n.d.). Retrieved from LatticeHacks:
  7. Silverman, J. H. (2015, January 12-16). NTRU and Lattice-Based Crypto: Past, Present, and Future. The Mathematics of Post-Quantum Cryptography. Retrieved May 19, 2020, from
  8. Stallings, W. (2017). Finite Fields. In W. Stallings, The principles and Practice of Cryptography and Network Security 7th Edition (Vol. 20, pp. 123-152). Pearson Education.
  9. Szudzik, M. (2006). An Elegant Pairing Function. Washington, DC. Retrieved from
  10. Union of Equivalence Classes is Whole Set. (n.d.). Retrieved from ProofWiki:
  11. Zhang, Z. (2017, July 12). A short review of the NTRU cryptosystem. Retrieved from
Index Terms

Computer Science
Information Sciences


Post quantum cryptography lattice-based encryption quantum cryptography Koblitz encoding post quantum cryptosystem ntru cryptography ntru cryptosystem.