Efficient and Secure SMS Encryption Technique using Elliptic Curve Cryptography
Keywords:
Encryption, Cryptography, Elliptic Curves, Elliptic Curve Cryptography, SMSAbstract
Data security over the cellular network is critical. Mobile phones have provided operators with immense facilities at the cost of data privacy. Without ensuring data concealment, communication should be avoided. This makes cryptography an evolving research area. In this paper, the authors propose an asymmetric encryption system which maintains data confidentiality and integrity of the text message throughout the mobile network.
In the proposed system, the text message is encrypted before being transmitted over the network. Most of the traditional encryption techniques are computationally intensive. Accordingly, elliptic curve cryptography has been employed to encrypt the text message as it permits efficient use of mobile’s limited resources like memory and processor. One of the key flaws in Short Message Service (SMS) is that it does not provide end-to-end security. The original text is revealed to the utility provider for a short duration of time which can be a reason for misuse. The system proposed offers this much needed data privacy.
References
. Ayushi, “A Symmetric Key Cryptographic Algorithm”, 2010 International Journal of Computer Applications (0975 - 8887) Volume 1 – No. 15
. Vivek Katiyar, Kamlesh Dutta, Syona Gupta, “A Survey on Elliptic Curve Cryptography for Pervasive Computing Environment“, International Journal of Computer Applications (0975 –8887) Volume 11–No.10, December 2010
. Atul Kahate, “Cryptography and Network Security”
. N Harini, C K Shyamala, T R Padmanabhan, “Cryptography and Security”
. Joseph H. Silverman,John T. Tate, “Rational Points on Elliptic Curves”
. J.S. Milne, “Elliptic Curves”, www.jmilne.org/math/Books/ectext5.pdf
. N. Jagdale, R.K.Bedi, Sharmishta Desai, “Securing MMS with High Performance Elliptic Curve Cryptography”, International Journal of Computer Applications (0975 – 8887) Volume 8– No.7, October 2010
. Ramratan Ahirwal, Anjali Jain, Y. K. Jain, “Signcryption Scheme that Utilizes Elliptic Curve for both Encryption and Signature Generation”, International Journal of Computer Applications (0975 – 8887) Volume 62– No.9, January 2013
. P.Vijayakumar, V.Vijayalakshmi, G.Zayaraz, “DNA Computing based Elliptic Curve Cryptography”, International Journal of Computer Applications (0975 – 8887) Volume 36– No.4, December 2011
. O.Srinivasa Rao, S. Pallam Setty, “Huffman Compression Technique in the Context of ECC for Enhancing the Security and Effective Utilization of Channel Bandwidth for Large Text”, IJCA Special Issue on “Network Security and Cryptography” NSC, 2011
. CH. Suneetha, D. Sravana Kumar, A. Chandrasekhar, “Secure Key Transport in Symmetric Cryptographic Protocols using some Elliptic Curves over finite fields”, International Journal of Computer Applications (0975 – 8887) Volume 36– No.1, December 2011
. William Stallings, “Cryptography and Network Security”, 3rd Edition
. N.Koblitz, “Elliptic Curve Cryptosystems, Mathematics of Computation”, volA8, 1987, pp.203 -209.
. Aqeel Khalique Kuldip Singh Sandeep Sood, “Implementation of Elliptic Curve Digital Signature Algorithm”, International Journal of Computer Applications (0975 – 8887)Volume 2 – No.2, May 2010
. Ajay R Mishra, “Fundamentals of Cellular Network Planning and Optimisation”
. Neetesh Saxena, Narendra S. Chaudhari, “A Secure Digital Signature Approach for SMS Security”, IP Multimedia Communications A Special Issue from IJCA
. Behrouz A. Forouzan, “Cryptography and Network Security” special Indian Edition 2007, Tata McGraw- Hill Publishing Company Limited, New Delhi
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
