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 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 t...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Complexity (New York, N.Y.) Ročník 2020; číslo 2020; s. 1 - 8
Hlavní autori: Sheikholeslami, S. M., Anoos, R., Kosari, S., Shao, Zehui, Dayap, J. A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Cairo, Egypt Hindawi Publishing Corporation 2020
Hindawi
John Wiley & Sons, Inc
Wiley
Predmet:
Algorithms
Cryptography
Data encryption
Encryption
Graphs
Keywords
ISSN:1076-2787, 1099-0526
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1076-2787
1099-0526
DOI:10.1155/2020/8316454