DIFFERENCE MODULO LABELING

In this paper, We prove that cycle Cn is a difference modulo labeled graph. We investigate the graph Pn2 and C3(t) is a difference modulo labeling. Here, the formulated edge labeling is considered as plaintext and with the help of affine cipher, we investigate a method of encryption and decryption o...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1362; no. 1; pp. 12049 - 12058
Main Authors Rekha, S., Maheswari, V.
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.11.2019
Subjects
affine cipher
Algorithms
and plaintext 2010 Mathematical subject classification Number: 05C78
Communications systems
Cycle graph
decipher
encipher
Encryption
Labeling
Physics
Online AccessGet full text

Cover

More Information
Summary:In this paper, We prove that cycle Cn is a difference modulo labeled graph. We investigate the graph Pn2 and C3(t) is a difference modulo labeling. Here, the formulated edge labeling is considered as plaintext and with the help of affine cipher, we investigate a method of encryption and decryption of a message for the system of secured communication.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1362/1/012049