@article{(Open Science Index):https://publications.waset.org/pdf/10008260,
	  title     = {A Study of General Attacks on Elliptic Curve Discrete Logarithm Problem over Prime Field and Binary Field},
	  author    = {Tun Myat Aung and  Ni Ni Hla},
	  country	= {},
	  institution	= {},
	  abstract     = {This paper begins by describing basic properties of finite field and elliptic curve cryptography over prime field and binary field. Then we discuss the discrete logarithm problem for elliptic curves and its properties. We study the general common attacks on elliptic curve discrete logarithm problem such as the Baby Step, Giant Step method, Pollard’s rho method and Pohlig-Hellman method, and describe in detail experiments of these attacks over prime field and binary field. The paper finishes by describing expected running time of the attacks and suggesting strong elliptic curves that are not susceptible to these attacks.c},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {11},
	  number    = {11},
	  year      = {2017},
	  pages     = {1221 - 1228},
	  ee        = {https://publications.waset.org/pdf/10008260},
	  url   	= {https://publications.waset.org/vol/131},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 131, 2017},
	}