Outer-convex dominating set in the corona of graphs as encryption key generator (Q2221650)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7304505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Outer-convex dominating set in the corona of graphs as encryption key generator |
scientific article; zbMATH DE number 7304505 |
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
0.7518941760063171
0 references
0.7289372682571411
0 references
0.6873037219047546
0 references
