Development of Quantum Safe Polynomial‐Based Cryptography in Classical and Quantum Framework

Abstract

The advent of quantum computers has brought forth a substantial danger to the security of current cryptographic algorithms, necessitating the development of quantum‐resistant algorithms to ensure data protection. The encryption method proposed in this article uses polynomials and is intended to counter key size‐based attacks. This paper brings a novel method of using polynomial interpolations for encryption and decryption, and the proposed algorithm is implemented in both classical and quantum environments to check its feasibility and accuracy. To ensure protection from the outside world, the proposed technique is applied in key generation, encryption, decryption, and confusion‐diffusion modules. This article also tabulated the National Institute of Standard and Technology (NIST) test suit results for randomness acceptability criteria and compares the new algorithm with the Kyber algorithm. While quantum computers are believed to excel in tasks like factorization and optimization, this paper is the first to explore cryptography algorithms in a quantum environment, opening new research possibilities for future cryptographic developments.