Application of Cosmos’s law of Merge and Split for Data Encryption

Full Text (PDF, 473KB), PP.11-20

Views: 0 Downloads: 0


Sanjay Kr. Pal 1,* Nupur Chakraborty 1

1. Department of Computer Science and Applications, NSHM College of Management and Technology, Kolkata, 700053, India

* Corresponding author.


Received: 15 Aug. 2016 / Revised: 2 Dec. 2016 / Accepted: 25 Feb. 2017 / Published: 8 May 2017

Index Terms

Encryption, Decryption, DivisionFactor, Node, Merge, Split


Sharing of data is always a crucial job in the world of data technology, where data are perceived as useful resources for generating significant information for taking notable decisions or for doing interpretation. On the basis of impact factor associated with the information, sharing and storage of data demands security. Sharing of large extent of textual sensitive data contained in a file needs a way of hidings their direct decipherment. Due to the size related restriction associated with steganography we always promote cryptography for sharing large amount of sensitive data. In this paper we have proposed an encryption technique with time complexity of O(1) that exploits the dynamic node fusion property of graph theory. We are applying the rule of cosmos which reveals that the entire cosmos relies on the conception of data hiding. Each time billions of particles merges to form a new structure and again splits, gets distributed and again follows the same process of hiding and disclosing the hidden truth in a cyclic manner. Following this logic we have proposed a dynamic layered encryption technique that will be completely able to resist the illicit actions of intruders with low computational efforts as well as it reduces the network load on packet transmission. In future with the successive increase in the processing power and requirements we can easily intensify the capacity of the proposed technique.

Cite This Paper

Sanjay Kr. Pal, Nupur Chakraborty, "Application of Cosmos’s law of Merge and Split for Data Encryption", International Journal of Computer Network and Information Security(IJCNIS), Vol.9, No.5, pp. 11-20, 2017. DOI:10.5815/ijcnis.2017.05.02


[1]Allam Mousa and Ahmad Hamad, “Evaluation of the RC4 Algorithm for Data Encryption”, International Journal of Computer Science & Applications, Vol. 3, No. 2, pp. 44-56, June 2006.
[2]Debajit Sensarma and Samar Sen Sarma, “GMDES: A Graph Based Modified Data Encryption Standard Algorithm With Enhanced Security”, International Journal of Research in Engineering and Technology, Vol. 3, Issue 3, pp. 653-660, March 2014.
[3]Himanshu Gupta and Vinod Kumar Sharma, “Multiphase Encryption: A New Concept in Modern Cryptography”, International Journal of Computer Theory and Engineering, Vol. 5, No. 4, pp. 638-640, August 2013.
[4]Huy Hoang Ngo, Xianping Wu, Phu Dung Le, Campbell Wilson and Balasubramaniam Srinivasan, “Dynamic Key Cryptography and Applications”, International Journal of Network Security, Vol. 10, No. 3,pp. 161-174, May 2010.
[5]Pal Sanjay Kumar and Sarma Samar Sen, “Hiding Information Using the Graph Colouring Technique”, International Journal of Applied Research on Information Technology and Computing, Vol. 3, Issue 3, pp.172-181, 2012.
[6]Parijit Kedia and Sumeet Agrawal, “Encryption using Venn-Diagrams and Graph”, International Journal of Advanced Computer Technology, Vol. 4, No. 1, pp. 94-99, February 2015.
[7]Sanjay Kumar Pal and Samar Sen Sarma, “Graph Coloring Approach for Hiding of Information”, Procedia Technology, Vol. 4, pp. 272-277, 2012.
[8]Sanjay Kumar Pal and Suman De, “An Encryption Technique based upon Encoded Multiplier with Controlled Generation of Random Numbers”, I. J. Computer Network and Information Security, Vol. 7, No. 10, pp. 50-57, September 2015.
[9]Srivatsan Iyer and Tejas Arackal, “Multi-part Dynamic Key Generation For Secure Data Encryption”, International Journal of Security, Vol. 8, Issue 4, pp. 37-46, 2014.
[10]Vinay Verma and Rajesh Kumar, “A Unique Approach to Multimedia Based Dynamic Symmetric Key Cryptography”, International Journal of Computer Science and Mobile Computing, Vol. 3, Issue 5, pp. 1119-1128, May 2014.
[11]Vishal Kumar, Ratnesh Kumar, Mashud A. Barbhuiya and Monjul Saikia, “Multiple Encryption using ECC and its Time Complexity Analysis”, International Journal of Computer Engineering In Research Trends, Vol. 3, Issue 11, pp. 568-572, November 2016.
[12]Yadhu Ravinath, Vipul Mangla, Arkajit Bhattacharya and Peeyush Ohri, “Graph Theory Application in Selective Encryption Mechanism for Wireless Ad Hoc Networks”, International Journal of Emerging Trends & Technology in Computer Science, Vol. 2, Issue 2, pp. 363-365, March-April 2013.
[13]Zeenat Mahmood, J.L Rana and Ashish Khare, “Symmetric Key Cryptography using Dynamic Key and Linear Congruential Generator (LCG)”, International Journal of Computer Applications, Vol. 50, No. 19, pp. 7-11, July 2012.
[14]Behrouz A Forouzan, “Data Communications and Networking”, 4th ed., Mc Graw Hill, New York City, NY, 2006.
[15]N. Deo, “Graph Theory with Applications to Engineering and Computer Science”, PHI, Englewood Cliffs, N.J., 2007.