ABSTRACT
Polynomial root discovery is applicable to cryptography domain in many aspects. There are number of methods such as bisection, Newton Raphson, and Secant being used to discover a possible root of a random polynomial. However primitive data types available with compilers are limiting the root convergence to the 15th degree of any polynomial effectively. In cryptography, polynomials with higher degrees can increase confidentiality levels and make a sustainable key against attacks from both classical and quantum computers. This paper reveals a method of using big number libraries for converging a root of a given higher degree polynomial, with proper verification, this can be applied to post quantum cryptographic algorithms for encryption and decryption.
