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

From MaRDI portal
Revision as of 03:32, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references