The Corona Graph for Symmetric Encryption Schemes

A special graph is defined in this work as new concept of graph theory. This graph is named as corona graph (CG) to design new versions of the symmetric encryption (SE) schemes. The ciphertexts of the plaintexts on designed versions are sent to the receiver entity as the CG. The CG is created based on a simple graph with original vertices and edges. Each original vertex has other vertices to form the corona vertices. A CG is generated depending on the random choices of the plaintext letters. The purpose for using the CG is to increase the security level of the SE schemes in comparison with previous encryption schemes. New experimental results of the proposed corona graphic symmetric encryption (CGSE) schemes are introduced through two study cases. On the CGSE schemes, the security issues are determined. The CGSE schemes consider as more suitable for secure SE communications.