The safety and security of various cryptosystems are related to the hardness of the integer factorization problem and discrete logarithm problem, most cryptosystems will be rendered vulnerable to attack and outdated as quantum computers become more advanced. This study examines lattice-based cryptography (the NTRU cryptosystem), compares the suggested variation to other cryptosystems by simulation and presents the execution time for key generation, encryption, and decryption procedures, as well as to highlight the benefits and drawbacks of the proposed cryptosystem. A variant of the NTRU cryptosystem is developed with the purpose of improving the cryptosystem's security by allowing it to withstand attacks in both classical and quantum computing. The simulation revealed that the existing NTRU cryptosystem has a better time complexity compared to the proposed NTRU cryptosystem. The existing NTRU cryptosystem has a time complexity of O(n2) while the proposed variant has O(n3). Though had a better capacity of handling large data because of the introduction of lattice multiplication.

Authors: Henry Chima Ukwuoma, Arome Junior Gabriel, Aderonke F. Thompson, Boniface Kayode Alese

Published in: International Conference for Internet Technology and Secured Transactions (ICITST-2021)

  • Date of Conference: 7-9 December 2021
  • DOI: 10.20533/ICITST.2021.0011
  • ISBN: 978-1-913572-39-6
  • Conference Location: Virtual (London, UK)