Int J Performability Eng ›› 2023, Vol. 19 ›› Issue (4): 252-262.doi: 10.23940/ijpe.23.04.p4.252262

Previous Articles     Next Articles

A Performance Analysis of Root-Converging Methods for Developing Post Quantum Cryptography Algorithms to Mitigate Key-Size-Based Attacks

Taniya Hasijaa, K. R. Ramkumara,*, Bhupendra Singhb, Amanpreet Kaura, and Sudesh Kumar Mittala   

  1. aChitkara University Institute of Engineering and Technology, Chitkara University, Punjab, India;
    bCentre for Artificial Intelligence & Robotics, Defense Research and Development Organization, Bangalore, India
  • Contact: *E-mail address:

Abstract: The upsurge growth of quantum computers poses many threats to existing classical cryptographic algorithms. The polynomials and root-converging methods are found to be suitable for developing a new generation of cryptographic algorithms. Among the many root-convergence methods, the Newton-Raphson is a promising approach according to the literature. It is an approximation method of finding the real root using linear approximation iteratively. Research advancements of the N/R method have improved the performance and space complexities. This research work proposes a new encryption and decryption algorithm for mitigating key size-based attacks using polynomial interpolations and gives a detailed account of various root convergence methods that are being used in the algorithms along with their merits and demerits.

Key words: post quantum cryptography, polynomial-based cryptography, root convergence methods, Newton Raphson method