Abstract
Three types of standard public-key cryptographic systems that can be considered secure, efficient, and commercially practical are (i) Integer Factorization Systems (e.g. RSA) (ii) Discrete Logarithm Systems (e.g. DSA) (iii) Elliptic Curve Cryptosystems (ECC). The security of these systems is based on the relative complexity of the underlying mathematical problem. Of all these systems, for a given key size, ECC is the most secure public key cryptosystem. A survey of various protocols based on ECC has been done in the paper. The protocols have been classified according to their use in various cryptographic security mechanisms i.e. key agreement protocols, digital signature and encipherment. A comparison of ECC with conventional public key systems reveals that ECC is best suited for applications such as mobile computing, wireless sensor networks and other devices with constrained resources.
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
Preview
Unable to display preview. Download preview PDF.
References
Azim, M.A., Jamalipour, A.: An Efficient Elliptic Curve Cryptography based Authenticated Key Agreement Protocol for Wireless LAN Security. In: IEEE International Conference on High Performance Switching and Routing (2005)
Wang, Y., Ramamurthy, B., Zou, X.: The Performance of Elliptic Curve Based Group Diffie-Hellman Protocols for Secure Group Communication over Ad Hoc Networks. In: IEEE International Conference on Communication (2006)
Rahman, M.M., El-Khatib, K.: Private key agreement and secure communication for heterogeneous sensor networks. J. Parallel and Distributed Computing 70, 858–870 (2010)
Juang, W.S., Chen, S.T., Liaw, H.T.: Robust and Efficient Password –Authenticated Key Agreement Using Smart Cards. IEEE Transactions on Industrial Electronics 55(6) (2008)
Yang, J.H., Chang, C.C.: An ID-based remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystems. J. Computer & Security 28, 138–143 (2009)
Yang, J.H., Chang, C.C.: An efficient three-party authenticated key exchange protocol using elliptic curve cryptography for mobile-commerce environments. J. Systems and Software 82, 1497–1502 (2009)
Tzeng, S.F., Hwang, M.S.: Digital Signatures with message recovery and its variants based on elliptic curve discrete logarithm problem. J. Computer Standards & Interface 26, 61–71 (2004)
Zuhua, S.: Improvement of digital signatures with message recovery and its variants based on elliptic curve discrete logarithm problem. J. Computer Standards & Interface 27, 61–69 (2004)
Chen, T.S., Chung, Y.F., Huang, G.S.: Efficient proxy multisignature scheme based on the elliptic curve cryptosystem. Computer & Society 22(6), 527–534 (2003)
Hwang, M.S., Tzeng, S.F., Tsai, C.S.: Generalization of proxy signature based on elliptic curves. J. Computer Standards & Interface 26, 73–84 (2004)
Sun, X., Xia, M.: An improved Proxy Signature Scheme Based on Elliptic Curve Cryptography. In: International Conference on Computer and Communications Security. IEEE Computer Society, Los Alamitos (2009)
Chen, T.S.: A specifiable verifier group-oriented threshold signature scheme based on the elliptic curve cryptosystem. J. Computer Standards & Interface 27, 33–38 (2004)
Jianfen, P., Yajian, Z., Cong, W., Yixian, Y.: An application of Modified Optimal –Type Elliptic Curve Blind Signature Scheme to Threshold Signature. In: International Conference on Networking and Digital Society. IEEE, Los Alamitos (2010)
Chen, T.S., Huang, K.H., Chung, Y.F.: A practical authenticated encryption scheme based on the elliptic curve cryptosystems. Computer Standards & Interface 26, 461–469 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalra, S., Sood, S.K. (2011). Elliptic Curve Cryptography: Current Status and Research Challenges. In: Mantri, A., Nandi, S., Kumar, G., Kumar, S. (eds) High Performance Architecture and Grid Computing. HPAGC 2011. Communications in Computer and Information Science, vol 169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22577-2_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-22577-2_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22576-5
Online ISBN: 978-3-642-22577-2
eBook Packages: Computer ScienceComputer Science (R0)