Attack Experiments on Elliptic Curves of Prime and Binary Fields

Hla, Ni Ni; Aung, Tun Myat

dc.contributor.author	Hla, Ni Ni
dc.contributor.author	Aung, Tun Myat
dc.date.accessioned	2020-02-14T02:50:50Z
dc.date.available	2020-02-14T02:50:50Z
dc.date.issued	2018-12-12
dc.identifier.citation	DOI: 10.1007/978-981-13-1951-8_60	en_US
dc.identifier.isbn	978-981-13-1950-1
dc.identifier.issn	2194-5357
dc.identifier.uri	http://onlineresource.ucsy.edu.mm/handle/123456789/2487
dc.description.abstract	At the beginning the paper describes the basic properties of finite field arithmetic and elliptic curve arithmetic over prime and binary fields. Then it discusses the elliptic curve discrete logarithm problem and its properties. We study the BabyStep, Giant-Step method, Pollard’s rho method and Pohlig–Hellman method, known as general methods that can exploit the elliptic curve discrete logarithm problem, and describe in detail attack experiments using these methods over prime and binary fields. Finally, the paper discusses the expected running time of these attacks and suggests the strong elliptic curves that are not vulnerable to these attacks.	en_US
dc.language.iso	en	en_US
dc.publisher	Advances in Intelligent Systems and Computing (IEMIS 2018 Vol. 1)	en_US
dc.relation.ispartofseries	Springer AISC;Vol. 755, No. 1, pp. 667-683
dc.title	Attack Experiments on Elliptic Curves of Prime and Binary Fields	en_US
dc.type	Article	en_US