Key Generation using Curve Fitting for Polynomial based Cryptography

Abstract

Every organization's primary concern is security. A cryptography method will remain safe in the system if the key is not cracked by a hacker through any kind of attacks. A conventional cryptography algorithm's strength relies on the key size and structure. Cryptography algorithms can be susceptible to brute force attacks since their keys have fixed lengths. The advantage of having a variable length key is leveraged to mitigate key-Size based attacks by using polynomials. This article outlines an algorithm for generating and maintaining the keys based on the polynomials and interpolation.