Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator. (26th October 2020)

• Record Type: Journal Article
• Authors: Shao, Zehui; Kosari, S.; Anoos, R.; Sheikholeslami, S. M.; Dayap, J. A.
• Other Names: Lopez Gutierrez Rosa M. Academic Editor.
• Is Part Of: Complexity. Volume 2020(2020)
• Publication Date: 2020-10-26
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2020/8316454
• Languages: English
• ISSNs: 1076-2787

Abstract

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.