TY - JOUR ID - 114288 TI - An Example on Elliptic Curve Cryptography JO - Annals of Optimization Theory and Practice JA - AOTP LA - en SN - 2588-3666 AU - Sharafi, Javad AD - University of Imam Ali, Iran Y1 - 2019 PY - 2019 VL - 2 IS - Issue 3 & 4 SP - 25 EP - 32 KW - El-Gamal algorithm KW - Elliptic Curve Cryptography KW - Finite Fields KW - Point Addition DO - 10.22121/aotp.2020.217266.1028 N2 - 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. UR - https://aotp.fabad-ihe.ac.ir/article_114288.html L1 - https://aotp.fabad-ihe.ac.ir/article_114288_1dbbc95c2821fcbc1b628f34c9bc9078.pdf ER -