Abstract
In this paper, we present a new type of symmetric encryption by converting the classical monoalphabetic affine cipher into a polyalphabetic cipher. The proposed encryption utilizes the properties of outer-convex dominating set in the corona of graphs to generate random keys from the shared keyword to every character of the message. The new encryption eliminates the weaknesses of affine cipher, thus increasing the level of confidence for exchanging messages.
Highlights
One of the simplest methods for encrypting text is the substitution cipher
Modern ciphers possess two important properties: diffusion and confusion. e idea of diffusion is to hide the relationship between the cipher text and the plain text. is Complexity will frustrate the adversary who uses the cipher text statistics to find the plain text. e idea of confusion is to hide the relationship between the cipher text and the key. is will frustrate the adversary who tries to use the cipher text to find the key
Affine cipher is a kind of monoalphabetic substitution cipher, in which each letter in the alphabet is converted to its numeric equivalent, encrypted by a simple arithmetical equation, and converted back to the letter. is cipher is defined by the following rule: (i) Encryption rule: C ≡ aP + b(mod 26)
Summary
Us, the graph G has the minimum outer-convex dominating sets presented in Table 1 (here, we define the minimum outer-convex dominating set as a permutation of the minimum outer-convex dominating set with respect to its position)
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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
