A Performance Analysis of Root-Converging Methods for Developing Post Quantum Cryptography Algorithms to Mitigate Key-Size-Based Attacks
Taniya Hasija, K. R. Ramkumar, Singh Bhupendra, Amanpreet Kaur, Kumar Mittal Sudesh · International Journal of Performability Engineering · 2023
The upsurge growth of quantum computers poses many threats to existing classical cryptographic algorithms.The polynomials and rootconverging methods are found to be suitable for developing a new generation of cryptographic algorithms.Among the many rootconvergence 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.