Short message service (S.M.S) security is a very important issue in today’s time. In spite of the fact that instant messengers have become very popular, S.M.S is still used. S.M.S is prone to several attacks and is not yet marked as a safe means for communication. Security in S.M.S includes message authentication, user authentication, encryption and decryption of the message and Spam .This paper deals with the survey of all these aspects of security in order find the best options available for each of them today .It is found that the most widespread functions are SHA-1(Secure Hash Algorithm- 1) and MD5(Message Digest) , MD5 hash algorithm when used with RSA provides a very strong means for authentication of the user , ElGamal algorithm is the most effective for encryption/decryption of SMS and SVM(Support Vector Machine) is the best machine learning technique for SPAM detection.

Elgamal , MD5, HMAC, Message digest, non spam , SMS, spam, support vector machines (SVM)

[1] S.Sharma, J.S.Yadav and P.Sharma, “Modified RSA Public Key Cryptosystem Using Short Range Natural Number Algorithm”,IJARCSSE, volume 2, August, 2012.
[2] S.Amari, S.Wu,"Improving support vector machine classifiers by modifying kernel functions". Neural Networks, Page No(783– 789),1999.
[3] M. Kim, J. Kim, and J. H. Cheon, “Compress Multiple Ciphertexts using ElGamal Encryption Schemes”, J. Korean Math. Soc, vol. 50, Page No(361-377),2013.
[4] M. Hassinen, “Java based public key infrastructure for sms messaging”, Proc. 2nd International Conference on Information and Communication Technologies,ICTTA’06,Page No (88-93),2006.
[5] S. Singh and E. K. Saurabh, “Providing Security in Data Aggregation using RSA algorithm”, International Journal of Computers & Technology, vol. 3, Page No(60-65) ,2012,.
[6] D. Lisonek and M. Drahansky, “Sms encryption for mobile communication”, Proc. International Conference on Security Technology, SECTECH’08,Page No(198-201),2008,
[7] A. De Santis, A. Castiglione, G. Cattaneo, M. Cembalo, F. Petagna, and U. F. Petrillo, “An extensible framework for efficient secure SMS”, Proc. International Conference on Complex, Intelligent and Software Intensive Systems (CISIS), Page No(843-850), 2010.
[8] N.Saxena and N. S. Chaudhari, “Secure encryption with digital signature approach for Short Message Service”, Proc. World Congress on Information and Communication Technologies (WICT),Page No(803-806), 2012.
[9] I. Yiakoumis, M. Papadonikolakis, H. Michail and A. P. Kakarountas, “Efficient Small-Sized Implementation of the Keyed-Hash Message Authentication Code”,eurocon 2005 , Serbia & Montenegro, Belgrade, Page No (22-24), November 2005.
[10] V. Patidar, D. Singh, A. Singh, “A Novel Technique of Email Classification for Spam Detection”, International Journal of Applied Information Systems (IJAIS) – ISSN : 2249-0868 Foundation of Computer Science FCS, New York, USA Volume 5 – No. 10, August 2013.
[11] V. R. Pallipamu, T. R. K, S. V. P, “Design of RSA digital scheme using a novel cryptographic hash algorithm”, International Journal of Emerging Technology and Advanced Engineering, Volume 4, Issue 6, June 2014.
[12] Prof. Rashmi RameshChavan and Prof. ManojSabness,“Secured mobile messaging” , International conference On computing,doi:10.1109/ICCEET.2012.6203858,Page No (1036 – 1043),2012.
[13] A. De Santis, A.Castiglione, G.Cattaneo, M.Cembalo ,F.Petagna, and U.F.Petrillo, “ An extensible framework for efficient secure SMS”, Proc. International Conference on Complex Intelligent and Software Intensive System,2010
[14] “Spam”,http://www.kaspersky.com/about/news/spam,2015
[15] Zahra S.Torabi, Mohammad H.NadimiShahraki, Isfahan,Iran and Akbar Nabiollahi,”Efficient Support Vector Machines for SpamDetection: A Survey",(IJCSIS) International Journal of Computer Science and Information Security,Vol. 13, No. 1, January 2015.
[16] “Spam News”,https://en.wikipedia.org/wiki/Acision,2015
[17] Bharat Gupta, Dr. Rajeev Gupta,”Performance Evaluation of Modified Signcryption Scheme”, International Journal on Computer Science and Engineering (IJCSE), ISSN : 0975-3397, Vol. 4 No. 12, Page No ( 1881-1889), Dec 2012.