Abstract

This work presents new contribution of graph theory for symmetric cryptographic applications. A tensor product bipartite graph (TPBG) is used to propose new symmetric encryption schemes. On proposed encryption schemes, the ciphertexts of the plaintexts are sent to receiver entity as the TPBGs. Based on two graphs G1 and G2, the TPBG is created depending on the random choices of the plaintext bits. These bits are used as vertices of graphs G1 and G2. The purpose for using the TPBG is to increase the security level of the symmetric encryption schemes in compare with other encryption schemes. Two study cases of the proposed symmetric TPB graphic (STPBG) encryption schemes are presented as new experimental results. The security issues of the proposed STPBG encryption schemes are determined. The STPBG encryption schemes consider as new insights for more secure communications.

Full Text
Paper version not known

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 call

Disclaimer: 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.