An Example on Elliptic Curve Cryptography

Document Type : Original Article

Author

University of Imam Ali, Iran

Abstract

Cryptography on Elliptic curve is one of the most important public key encryption systems, whose security depends on difficulty of solving the discrete logarithm problem. The reason of importance is that elliptic curves provide security equivalent to classical systems while using fewer bits. To encrypt a plain message with El-Gamal algorithm, we embed the message to the point on the elliptic curve using the Koblitz technique. In this paper, we explore the conditions that encrypt the message without mapping the point on the elliptic curve.

Keywords

References

Singh, L. D., & Singh, K. M. (2015). Implementation of text encryption using elliptic curve cryptography. Procedia Computer Science, 54, 73-82.
Singh, L. D., & Singh, K. M. (2017). Medical image encryption based on improved El-Gamal encryption technique. CDATA [Optik – International Journal for Light and Electron Optics.
Koblitz, N. (1987). Elliptic curve cryptosystems. Mathematics of computation, 48(177), 203-209.
J. Ho_stein, J. Pipher, J. H. Silverman (2008). An Introduction to Mathematical Cryptography, Springer.
Koblitz, N. (1994). A course in number theory and cryptography (Vol. 114). Springer Science & Business Media.
Washington, L. C. (2008). Elliptic curves: number theory and cryptography. CRC press.
Annals of Optimization Theory and Practice
Volume 2, Issue 3 & 4
December 2019
Pages 25-32

Files

Share

How to cite

Statistics