The Concept of Basic Cipher Text for Enhancing Security in the Algorithms of Cryptography Applications Using Labelled Graphs

Auparajita Krishnaa¹ , Dharmendra Kumar Gurjar²

1. Department of Mathematics and Statistics, Mohan Lal Sukhadia University, Udaipur ,Rajasthan, India.
2. Department, Department of Mathematics and Statistics, Mohan Lal Sukhadia University, Udaipur ,Rajasthan, India.

Section:Research Paper, Product Type: Journal-Paper
Vol.10 , Issue.3 , pp.9-13, Jun-2023

Online published on Jun 30, 2023

Copyright © Auparajita Krishnaa, Dharmendra Kumar Gurjar . 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

XML View     PDF Download

How to Cite this Paper

112 Views    181 Downloads    18 Downloads

Abstract :
This paper provides the idea of Basic Cipher Text which is a step prior to developing the final Cipher Text. This Basic Cipher Text enhances the security of the Cipher Text still further. Sometimes matrices are used in Cryptography applications which can result in the situation where there is a repetition of row/column thus rendering it unsuitable for calculation of the Inverse of such a matrix – this situation is also taken up. Lexicographic labelled graphs can be used in creation of Basic Cipher Text in a relatively simple way and results in a much hidden Cipher Text subsequently. Moreover, wherever the need for all distinct letters in creation of the Cipher Text arises, these methods can be used with any encryption and decryption techniques. As another option, the Basic Cipher Text can also be used as the final Cipher Text itself and then proceeding with decryption given in this work.

Key-Words / Index Term :
Basic Cipher Text, Basic Plain Text, Cipher Text, Plain Text, Inverse matrix, Labelled graph, Lexicographic order, Antimagic graph labelling, Felicitous graph labelling.

References :
[1]. Auparajita Krishnaa, “Inner Magic and Inner Anatimagic Graphs in Cryptography”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 22, no. 6, pp. 1057-1066, 2019.
[2]. Dharmendra Kumar Gurjar , Auparajita Krishnaa, “Lexicographic Labelled Graphs in Cryptography”, Advances and Applications in Discrete Mathematics, vol, 27,Issue 2, pp. 209-232, 2021,
[3]. Dharmendra Kumar Gurjar and Auparajita Krishnaa, “Various Antimagic Labeled Graphs from Graph Theory for Cryptography Applications”, International Journal of Scientific Research in Mathematical and Statistical Sciences, ISROSET publisher, vol. 9, issue 3, pp. 11-18, 2022.
[4]. Dharmendra Kumar Gurjar, Auparajita Krishnaa,, “ Complete Graph and Hamiltonian Cycle in Encryption and Decryption”, International Journal of Mathematics Trends and Technology, vol. 67, issue 12, pp. 42-51, 2021
[5]. P. Mohan, . K. Rajendran ,. A. Rajesh, , “An encryption Technique Using a Complete Graph With A Self-Invertible Matrix”, Journal of Algebraic Ststistics, vol. 13, issue 3, pp. 1821-1826, 2022.
[6]. Sachin Sharma, Jeevan Singh Bisht, “Performance Analysis of Data Encryption Algorithms”, Internal Journal of Scientific Research in Network Security and Communication, ISROSET publisher, vol. 3, issue 1, pp 1-4, 2015.
[7]. Nandhini R., Maheswari V. ,Balaji V “A Graph Theory Approach on Cryptography”, Journal of Computational Mathematics, vol. 2 issue 1,pp. 97-104, 2018.