Outer-convex dominating set in the corona of graphs as encryption key generator

DOI10.1155/2020/8316454MaRDI QIDQ2221650zbMATH OpenOpenAlexWikidataFDO

Authors Zehui Shao, Saeed Kosari, R. Anoos, J. A. Dayap, Seyed Mahmood Sheikholeslami

Publication date 2 February 2021

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/8316454

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of graph theory (05C90) Cryptography (94A60)

Review text

Summary: 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.

Recommendations

• Some graph-based encryption schemes
• Graph based private key crypto-system
• scientific article; zbMATH DE number 2081145
• scientific article; zbMATH DE number 6429293
• Graphs with special arcs and cryptography

Cites work

• Communication Theory of Secrecy Systems*
• Outer-convex domination in graphs
• Outer-weakly convex domination number of graphs
• The convex domination subdivision number of a graph

Cited in

(3)

• Some graph-based encryption schemes
• On local super antimagic total face coloring and the application in developing a cipher block chaining key
• scientific article; zbMATH DE number 7690927 (Why is no real title available?)

This page was built for publication: Outer-convex dominating set in the corona of graphs as encryption key generator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221650)