Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator
Joint Authors
Shao, Zehui
Sheikholeslami, S. M.
Kosari, S.
Anoos, R.
Dayap, J. A.
Source
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-10-26
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Shao, Zehui& Kosari, S.& Anoos, R.& Sheikholeslami, S. M.& Dayap, J. A.. 2020. Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator. Complexity،Vol. 2020, no. 2020, pp.1-8.
https://search.emarefa.net/detail/BIM-1144220
Modern Language Association (MLA)
Shao, Zehui…[et al.]. Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator. Complexity No. 2020 (2020), pp.1-8.
https://search.emarefa.net/detail/BIM-1144220
American Medical Association (AMA)
Shao, Zehui& Kosari, S.& Anoos, R.& Sheikholeslami, S. M.& Dayap, J. A.. Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator. Complexity. 2020. Vol. 2020, no. 2020, pp.1-8.
https://search.emarefa.net/detail/BIM-1144220
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1144220
