A Study of General Attacks on Elliptic Curve Discrete Logarithm Problem over Prime Field and Binary Field

Aung, Tun Myat; Hla, Ni Ni

dc.contributor.author	Aung, Tun Myat
dc.contributor.author	Hla, Ni Ni
dc.date.accessioned	2020-02-14T02:37:29Z
dc.date.available	2020-02-14T02:37:29Z
dc.date.issued	2017-11
dc.identifier.citation	DOI:10.5281/zenodo.1314552	en_US
dc.identifier.issn	2517-9942
dc.identifier.uri	http://onlineresource.ucsy.edu.mm/handle/123456789/2485
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Information, Control and Computer Sciences	en_US
dc.relation.ispartofseries	;Vol. 11, No. 11, pp. 1153-1160
dc.subject	Discrete logarithm problem	en_US
dc.subject	general attacks	en_US
dc.subject	elliptic curves	en_US
dc.subject	strong curves	en_US
dc.subject	prime field	en_US
dc.subject	binary field	en_US
dc.subject	attack experiments	en_US
dc.title	A Study of General Attacks on Elliptic Curve Discrete Logarithm Problem over Prime Field and Binary Field	en_US
dc.type	Article	en_US