Apex Magic Square Labeling for Complete Bipartite Graph and their application using Enigma
DOI:
https://doi.org/10.26438/ijcse/v6i5.10621066Keywords:
RSA, ,bipartitegraph, Apexmagicsquare, Enigma, SAMTLAbstract
Achieving better phases of security in transferring an image over LAN or internet and performance of enigma is depends on its efficiency based on time taken and the way it generates different graphs from a pixel. The most widely used algorithms are RSA, public key algorithm and other such algorithms does not provide full security to the cipher text, RSA is not going to assure the enigma while transforming the images. A better approach is to use Apex magic total Labeling (AMTL) of complete graph. It increases the efficiency by adding more extra security to the enigma systems. This method provides more security due to its difficulty in encryption in AMTL formation that cannot be easily found. This proposed research work provides an additional level of security to public key algorithms such as RSA, DH algorithm, etc. this approach is experimented in simulated systems like MATLAB.
References
[1] Krishnappa H.K., Kishore Kottapalli, V.Ch. Venkaiah, “On Apex Magic Total Labeling of Complete graphs”, AKCE Journal of Graphs and Combin, 6, No.1(2009)pp.143-154.
[2] J.A. MacDougall, M.Miller, K.A.Sugeng, “Super Magic Total Labelings of graphs”, Proceeding of the Fifteenth Australian workshop on Combinatorial Algorithms 2004, Balina, NSW, (2004), 222-229.
[3] K.A.Sugeng, M.Miller, M.Baca and Slamin, “Super Edge Anti Magic Total Labeling of Catterpillars”, Lecture note in Computer Science (IJCGGT-2003), Vol.3330, (2005)
[4] K.A.Sugeng and W.Xie, “Construction of Super edge magic total graphs”, Proceedings of 16th Australian Workshop on Combinatorial Algorithms 2005, Ballarat, Australia, (2005), 303-310.
[5] Y. H. Yu, C. C. Chang and Y. C. Hu, ―Hiding Secret Data in Images via Predictive Coding,‖ Pattern Recognition, vol. 38, pp. 691-705, 2005.
[6] Nameer N. EL-Emam, ―”Hiding a Large Amount of Data with High Security Using Enigma Algorithm”, Journal of Computer Science, vol. 3 (4), pp. 223-232, 2007.
[7] S.G.K.D.N. Samaratunge, ―”New Enigma Technique for Palette Based Images”,In Second International Conference on Industrial and Information Systems, pp. 335-340, Aug. 8 – 11, 2007.
[8] J. He, S. Tang and T. Wu, ―”An Adaptive Image Enigma Based on Depth-Varying Embedding”, In Congress on Image and Signal Processing, vol. 5, pp. 660-663, 27-30 May 2008.
[9] Krishnappa.H.K., N.K.Srinath and P.Ramakanth Kumar, “Vertex Magic Total Labeling of Complete graphs”, IJCMSA., Vol 4, No 1-2 (2010), 157-169.
[10] S Roy and D.G. Akka, “On complementary edge magic of certain graphs”, American Journal of Mathematics and Statistics 2012,2(3):22-26.
[11] R.Rajeshwari, R.Parameswari,”Total Magic Cordial Labeling of Star related grapgh”, 2017 international conference on intelligent computing and control (I2C2).
[12] Hao Lu; Mahantesh Halappanavar; Daniel Chavarria-Miranda; Assefaw H,” Algorithms for Balanced Graph Colorings with Application in Parallel Computing”.2017 IEEE Transaction on Parallel and Distributed System (volume:28).
[13] A Gupta, E Sharma, N Sachan, N Tiwari, “ Door Lock System Through Face recognition using MATLAB”, International Journal of Scientific Research in Computer Science and Engineering-2014.
[14] M Bandyopadhya, S Chattopadhaya, A Das, “ Emphasis on Genetic Algorithm over Different PLD Tuning Methods using MATAB”, International Journal of Scientific Research in Computer Science and Engineering-2013.
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.
