2026-07-27T04:11:08Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/4564 2021-12-13T02:13:25Z 1582963302567:1597824227696 user-ucsy

A Study of General Attacks on Elliptic Curve Discrete Logarithm Problem over Prime Field and Binary Field Aung, Tun Myat Hla, Ni Ni This paper begins by describing basic properties offinite field and elliptic curve cryptography over prime field andbinary field. Then we discuss the discrete logarithm problem forelliptic curves and its properties. We study the general commonattacks on elliptic curve discrete logarithm problem such as the BabyStep, Giant Step method, Pollard’s rho method and Pohlig-Hellmanmethod, and describe in detail experiments of these attacks overprime field and binary field. The paper finishes by describingexpected running time of the attacks and suggesting strong ellipticcurves that are not susceptible to these attacks. 2017-11 http://hdl.handle.net/20.500.12678/0000004564 https://meral.edu.mm/records/4564