Open Access   Article Go Back

Efficient and Secure SMS Encryption Technique using Elliptic Curve Cryptography

Anirban Bhowmick1

Section:Research Paper, Product Type: Journal Paper
Volume-3 , Issue-2 , Page no. 76-79, Feb-2015

Online published on Feb 28, 2015

Copyright © Anirban Bhowmick . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Anirban Bhowmick, “Efficient and Secure SMS Encryption Technique using Elliptic Curve Cryptography,” International Journal of Computer Sciences and Engineering, Vol.3, Issue.2, pp.76-79, 2015.

MLA Style Citation: Anirban Bhowmick "Efficient and Secure SMS Encryption Technique using Elliptic Curve Cryptography." International Journal of Computer Sciences and Engineering 3.2 (2015): 76-79.

APA Style Citation: Anirban Bhowmick, (2015). Efficient and Secure SMS Encryption Technique using Elliptic Curve Cryptography. International Journal of Computer Sciences and Engineering, 3(2), 76-79.

BibTex Style Citation:
@article{Bhowmick_2015,
author = {Anirban Bhowmick},
title = {Efficient and Secure SMS Encryption Technique using Elliptic Curve Cryptography},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {2 2015},
volume = {3},
Issue = {2},
month = {2},
year = {2015},
issn = {2347-2693},
pages = {76-79},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=407},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=407
TI - Efficient and Secure SMS Encryption Technique using Elliptic Curve Cryptography
T2 - International Journal of Computer Sciences and Engineering
AU - Anirban Bhowmick
PY - 2015
DA - 2015/02/28
PB - IJCSE, Indore, INDIA
SP - 76-79
IS - 2
VL - 3
SN - 2347-2693
ER -

VIEWS PDF XML
2730 2436 downloads 2427 downloads
  
  
           

Abstract

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.

Key-Words / Index Term

Encryption, Cryptography, Elliptic Curves, Elliptic Curve Cryptography, SMS

References

[1]. Ayushi, “A Symmetric Key Cryptographic Algorithm”, 2010 International Journal of Computer Applications (0975 - 8887) Volume 1 – No. 15
[2]. 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
[3]. Atul Kahate, “Cryptography and Network Security”
[4]. N Harini, C K Shyamala, T R Padmanabhan, “Cryptography and Security”
[5]. Joseph H. Silverman,John T. Tate, “Rational Points on Elliptic Curves”
[6]. J.S. Milne, “Elliptic Curves”, www.jmilne.org/math/Books/ectext5.pdf
[7]. 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
[8]. 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

[9]. 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
[10]. 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
[11]. 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
[12]. William Stallings, “Cryptography and Network Security”, 3rd Edition
[13]. N.Koblitz, “Elliptic Curve Cryptosystems, Mathematics of Computation”, volA8, 1987, pp.203 -209.
[14]. 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
[15]. Ajay R Mishra, “Fundamentals of Cellular Network Planning and Optimisation”
[16]. Neetesh Saxena, Narendra S. Chaudhari, “A Secure Digital Signature Approach for SMS Security”, IP Multimedia Communications A Special Issue from IJCA
[17]. Behrouz A. Forouzan, “Cryptography and Network Security” special Indian Edition 2007, Tata McGraw- Hill Publishing Company Limited, New Delhi