Abstract
Elliptic curve cryptography (ECC) provides a secure means of exchanging keys among communicating hosts using the Diffie–Hellman (DH) key exchange algorithm. This work presents an implementation of ECC encryption making use of the DH key exchange algorithm. Encryption and decryption of text messages have also been attempted. In ECC, we normally start with mapping a character of message to an affine point on the elliptic curve, which is called encoding. A comparison of the proposed algorithm and Koblitz’s method shows that the proposed algorithm is as secure as Koblitz’s encoding and has less computational complexity due to the elimination of encoding, thereby improving energy efficiency of the crypto-system to be used in resource constrained applications, such as wireless sensor networks (WSNs). It is almost infeasible to attempt a brute force attack. The security strength of the algorithm is proportional to key length. As the key length increases, the data that can be sent at a time also increase.
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
Lauter K (2004) The advantages of elliptic curve cryptography for wireless security. IEEE Wirel Commun 11(1):62–67
Tian X, Wong DS, Zhu RW (2005) Analysis and improvement of an authenticated key exchange protocol for sensor networks. IEEE Commun Lett 9(11):970–972
Hankerson D, Menezes AJ, Vanstone S (2004) Guide to elliptic curve cryptography. Springer, New York
Stallings W (2003) Network and internetwork security: principles and practice. Prentice-Hall, Inc., Englewood Cliffs
Hasan MA (2001) Power analysis attacks and algorithmic approaches to their countermeasures for koblitz curve cryptosystems. IEEE Trans Comput 50(10):1071–1083
Qiu Q, Xiong Q (2004) Research on elliptic curve cryptography. In: Proceedings of the 8th international conference on computer supported cooperative work in design, vol 2, pp 698–701
Khabbazian M, Gulliver TA, Bhargava VK (2007) Double point compression with applications to speeding up random point multiplication. IEEE Trans Comput 56(3):305–313
Longa P, Miri A (2008) Fast and flexible elliptic curve point arithmetic over prime fields. IEEE Trans Comput 57(3):289–302
Ramasamy RR, Prabakar MA, Devi MI, Suguna M (2009) Knapsack based ECC encryption and decryption. Int J Netw Secur 9(3):218–226
Padma Bh, Chandravathi D, Roja PP (2010) Encoding and decoding of a message in the implementation of elliptic curve cryptography using Koblitzs method. Int J Comput Sci Eng 2:1904–1907
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Kodali, R.K., Narasimha Sarma, N.V.S. (2014). Energy Efficient ECC Encryption Using ECDH. In: Sridhar, V., Sheshadri, H., Padma, M. (eds) Emerging Research in Electronics, Computer Science and Technology. Lecture Notes in Electrical Engineering, vol 248. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1157-0_48
Download citation
DOI: https://doi.org/10.1007/978-81-322-1157-0_48
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1156-3
Online ISBN: 978-81-322-1157-0
eBook Packages: EngineeringEngineering (R0)