International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 4 | Issue 3 | Year 2013 | Article Id. IJCTT-V4I3P126 | DOI : https://doi.org/10.14445/22312803/IJCTT-V4I3P126

Secure CRM Cloud Service using RC5 Algorithm

Sachindra K. Chavan, Prof. M. L. Bangare

Citation :

Sachindra K. Chavan, Prof. M. L. Bangare, "Secure CRM Cloud Service using RC5 Algorithm," International Journal of Computer Trends and Technology (IJCTT), vol. 4, no. 3, pp. 325-330, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V4I3P126

Abstract

Enterprises always used organizational internal storage system for storing data. Mainly in a Customer Relational Management i.e. CRM system, the internal storage will be used for storing all the data of the customer. On the other hand, the main drawbacks in the data storage is there may be intruder’s in the administrator side and they may acquire all the information about a customer. Above threats can happen in same service provider in a cloud computing environment. To overcome with this kind of challenges in cloud computing, there is need of an innovative algorithmic approach for data security in cloud computing. A CRM (Customer Relational Management) system services is represented in this paper using RC5 algorithm. In the proposed system the party that uses cloud storage services must encrypt data before sending it to cloud while the service provider who is responsible for encryption/decryption of the user’s data and then must delete data once encryption/decryption process is completed. In this paper the use of CRM services which demonstrates how the parties involved in secure storage and retrieval when data is saved to the cloud.

Keywords

Cloud Computing, CRM Service, Data Retrieval and Storage, Encryption/Decryption, RC5 algorithm, Secure Storage.

References

[1] Jing-Jang Hwang, Hung-kaiChung, Yi-Chang Hsu, Chien-Hsing Wu, “A Business Model for Cloud Computing Based on a Separate Encryption and Decryption Service” , IEEE 2011.
[2] National Institute of Standards and Technology - Computer Security Resource Center - www.csrc.nist.gov
[3] A. Weiss, “Computing in the clouds”, networker, vol. 11, no. 4, pp. 1625, December 2007.
[4] C. S. Yeo, S. Venugopal, X. Chu, and R. Buyya, "Autonomic metered pricing for a utility computing service", Future Generation Computer Systems, vol. 26, issue 8, pp. 1368-1380, October 2010. 
[5] M. Baker, R. Buyya, and D. Laforenza, “Grids and grid technologies for wide-area distributed computing,” International Journal Software:Practice and Experience, vol.32, pp. 1437-1466, 2002.
[6]  of B. R. Kandukuri, V, R. Paturi and A. Rakshit, “Cloud security issues,”in Proceedings of the 2009 IEEE International Conference on Services Computing, pp. 517-520, September 2009. 
[7] R. Sterritt, “Autonomic computing,” Innovations in Systems and Software Engineering, vol. 1, no. 1, Springer, pp. 79-88. 2005.
[8] R. Buyya, C. S. Yeo, S. Venugopal, J. Broberg, and I. Brandic, “Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility,” Future Generation Computer Systems, vol. 25, issue 6, pp. 599-616, June 2008. 
[9] L. M. Vaquero,L. Rodero-Merino,J. Caceres, and M. Lindner, “A break in the clouds: towards a cloud definition,” ACM SIGCOMM Computer Communication Review, vol. 39, no. 1, pp. 50-55, January 2009. 
[10] R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public key cryptosystems”, Communications of the ACM, vol. 21, no. 2, pp.120-126, 1978. 
[11] V. Miller, “Uses of elliptic curves in cryptography,” Advances in Cryptology - CRYPTO '85, Lecture Notes in Computer Science, pp. 417-426, 1986.
[12]  Norman D. Jorstad, Landgrave T. Smith, Jr., “CRYPTOGRAPHIC ALGORITHM METRICS”  Institute for Defense Analyses Science and Technology Division, Jan 1997.
[13] Harsh Kumar Verma, Ravindra Kumar Singh, “Performance Analysis of RC5, Blowfish and DES Block Cipher Algorithms” , in International Journal of Computer Applications (0975 – 8887) Volume 42– No.16, March 2012.