Year-end Sale % OFF 
Abstract
The present-day society depends heavily on digital technology where it is used in many applications such as banking and e-commerce transactions, computer passwords, etc. Therefore, it is important to protect information when storing and sharing them. Cryptography is the study of secret writing which applies complex math rules to convert the original message into an incomprehensible form. Graph theory is applied in the field of cryptography as graphs can be simply converted into matrices There are two approaches of cryptography; symmetric cryptography and asymmetric cryptography. This paper proposes a new connection between graph theory and symmetric cryptography to protect the information from the unauthorized parties. This proposed methodology uses a matrix as the secret key which adds more security to the cryptosystem. It converts the plaintext into several graphs and represents these graphs in their matrix form. Also, this generates several ciphertexts. The size of the resulting ciphertexts are larger than the plaintext size.
Highlights
The field of cryptology is divided into two parts namely, cryptography and cryptanalysis [5]
Cryptography is the art of converting the original message into an incomprehensible form, with the intention of hiding the meaning, so that only the parties who are intended can read and process the information
This paper proposes a new algorithm to encrypt and decrypt the message using graph theory in symmetric key cryptography
Summary
The field of cryptology is divided into two parts namely, cryptography and cryptanalysis [5]. In symmetric key cryptography, both the sender and the receiver use the same key to encrypt as well as to decrypt the message. The original message is encrypted into a Euler Graph This graph is converted into several matrices and sent to the receiver. In [4], a modified version of Affine cipher is proposed In this algorithm, each character of the plaintext is converted into a numeric value and these numeric values are plotted into a graph. Encryption algorithm is proposed using graph theory where the plaintext is divided into several blocks. These blocks are converted into graphs and their graph representations are sent to the receiver. This paper proposes a new algorithm to encrypt and decrypt the message using graph theory in symmetric key cryptography.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
