Polynomial Interpolation in the Elliptic Curve Cryptosystem
Liew Khang Jie and Hailiza Kamarulhaili
DOI : 10.3844/jmssp.2011.326.331
Journal of Mathematics and Statistics
Volume 7, 2011
Problem statement: In this research, we incorporate the polynomial interpolation method in the discrete logarithm problem based cryptosystem which is the elliptic curve cryptosystem. Approach: In this study, the polynomial interpolation method to be focused is the Lagrange polynomial interpolation which is the simplest polynomial interpolation method. This method will be incorporated in the encryption algorithm of the elliptic curve ElGamal cryptosystem. Results: The scheme modifies the elliptic curve ElGamal cryptosystem by adding few steps in the encryption algorithm. Two polynomials are constructed based on the encrypted points using Lagrange polynomial interpolation and encrypted for the second time using the proposed encryption method. We believe it is safe from the theoretical side as it still relies on the discrete logarithm problem of the elliptic curve. Conclusion/Recommendations: The modified scheme is expected to be more secure than the existing scheme as it offers double encryption techniques. On top of the existing encryption algorithm, we managed to encrypt one more time using the polynomial interpolation method. We also have provided detail examples based on the described algorithm.
© 2011 Liew Khang Jie and Hailiza Kamarulhaili. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.