Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator

In this paper, we present a new type of symmetric encryption by converting the classical Desk 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 Food Service:Wholesale Lots 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.