Abstract
This work presents the employment of graph theory for cryptographic applications. A Cartesian product graph (CPG) is used to propose new symmetric encryption schemes. On proposed encryption schemes, the ciphertexts of the plaintexts are sent to the receiver entity as the CPGs. The CPG is created based on two graphs G and H that are generated depending on the random choices of the plaintext bits. These bits are used as vertices of graphs G and H. The purpose of using the CPG is to increase the security level of the symmetric encryption schemes in comparison with other encryption schemes. Two study cases of the proposed symmetric Cartesian product graphic encryption (SCPGE) schemes are presented as new experimental results. The security issues of the proposed SCPGE schemes are determined. The SCPGE schemes consider as new insights for more secure communications.
Sign-in/Register to access full text options 
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.
