z-logo
open-access-imgOpen Access
Some Graph-Based Encryption Schemes
Author(s) -
Baizhu Ni,
Rabiha Qazi,
Shafiq Ur Rehman,
Ghulam Farid
Publication year - 2021
Publication title -
journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.252
H-Index - 13
eISSN - 2314-4785
pISSN - 2314-4629
DOI - 10.1155/2021/6614172
Subject(s) - encryption , bipartite graph , cryptography , theoretical computer science , probabilistic encryption , mathematics , multiple encryption , secure communication , computer science , graph , computer security
In today’s technological world, confidentiality is an important issue to deal with, and it is carried out through different proficiencies. Cryptography is a scientific technique of securing a communication from unauthenticated approach. There exist many encryption algorithms in cryptography for data security. The need of new nonstandard encryption algorithms has been raised to prevent the communication from traditional attacks. This paper proposes some new encryption algorithms for secure transmission of messages using some special corona graphs and bipartite graph along with some algebraic properties. These proposed encryption schemes will lead to more secure communication of secret messages.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom