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

Zehui Shao, S. Kosari, R. Anoos, S. M. Sheikholeslami and J. A. Dayap

Complexity, 2020, vol. 2020, 1-8

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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/8316454.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/8316454.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:8316454

DOI: 10.1155/2020/8316454

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().