• Anu Pius
• SENTHIL KUMAR B

This research introduces the arithmetic logic behind elliptic curve cryptography. We initially discuss on the notion about asymmetric key cryptosystems, which depend on mathematical issues which require large time for computing. Elliptic curve cryptosystems frame illustrations of PKC'S and depend on DLP. We additionally treat certain hypothesis about elliptic curves, particularly the ones over limited fields. Especially to evade certain critical bouts against ECDL, distinctive focus were proposed on certain parameters. Finally, we depict general strategies to take after when outlining ECDL.

"A STUDY ON ARITHMETIC LOGIC IN ELLIPTIC CURVE CRYPTOSYSTEMS USING DISCRETE LOGARITHM PROBLEMS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 8, page no.365-368, August-2018, Available :http://www.jetir.org/papers/JETIR1808352.pdf

"A STUDY ON ARITHMETIC LOGIC IN ELLIPTIC CURVE CRYPTOSYSTEMS USING DISCRETE LOGARITHM PROBLEMS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 8, page no. pp365-368, August-2018, Available at : http://www.jetir.org/papers/JETIR1808352.pdf