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 Baby-Step, 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anoop, M.S.: Elliptic Curve Cryptography. http://www.infosecwriters.com/Papers/Anoopms_ECC.pdf
Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer press (2004)
Lidl, R., Niederreiter, H.: Introduction to Finite Field Arithmetic and their Applications. Cambridge University Press (1986)
Behrouz, A.: Forouzan, Cryptography and Network Security. McGraw-Hill press, International Edition (2008)
Liao, H.-Z., Shen, Y.-Y.: On the elliptic curve digital signature algorithm. Tunghai Sci. 8 (2006)
Karthikeyan, E.: Survey of elliptic curve scalar multiplication algorithms. Int. J. Adv. Netw. Appl. 04(02) (2012)
Washington, L.C.: Elliptic Curves: Number Theory and Cryptography. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL (2003)
Musson, M.: Attacking the elliptic curve discrete logarithm problem. Master Thesis of Science (Mathematics and Statistics) Acadia University (2006)
Rosen, K.H.: Discrete Mathematics and its Applications, Global Edition (2008)
Hla, N.N., Aung, T.M.: Implementation of finite field arithmetic operations for large prime and binary fields using java BigInteger class. Int. J. Eng. Res. Technol. (IJERT), 6(08) (2017)
Aung, T.M., Hla, N.N.: Implementation of elliptic curve arithmetic operations for prime field and binary field using java BigInteger class. Int. J. Eng. Res. Technol. (IJERT), 6(08) (2017)
Recommended Elliptic Curves for Federal Government Use, NIST (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Hla, N.N., Aung, T.M. (2019). Attack Experiments on Elliptic Curves of Prime and Binary Fields. In: Abraham, A., Dutta, P., Mandal, J., Bhattacharya, A., Dutta, S. (eds) Emerging Technologies in Data Mining and Information Security. Advances in Intelligent Systems and Computing, vol 755. Springer, Singapore. https://doi.org/10.1007/978-981-13-1951-8_60
Download citation
DOI: https://doi.org/10.1007/978-981-13-1951-8_60
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1950-1
Online ISBN: 978-981-13-1951-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)