Outer-convex dominating set in the corona of graphs as encryption key generator (Q2221650): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Communication Theory of Secrecy Systems* / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The convex domination subdivision number of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Outer-weakly convex domination number of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Outer-convex domination in graphs / rank | |||
Normal rank | |||
Latest revision as of 12:18, 24 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Outer-convex dominating set in the corona of graphs as encryption key generator |
scientific article |
Statements
Outer-convex dominating set in the corona of graphs as encryption key generator (English)
0 references
2 February 2021
0 references
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.
0 references
