Stream-keys generation based on graph labeling for strengthening Vigenere encryption

Prihandoko, Antonius Cahya; Dafik, Dafik; Agustin, Ika Hesti

doi:10.11591/ijece.v12i4.pp3960-3969

Cited by 2 publications

(4 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The need for a trusted third party also becomes redundant. We also subject our key generation technique to entropy analysis and prove its efficacy compared to the traditional random number generator technique and super H-antimagic total labeling (SHATL) [27].…”

Section: Figure 1: Entropy Analysismentioning

confidence: 99%

“…In [27], graph labeling such as super H-antimagic total labeling (SHATL) to generate stream-keys and providing different encryption keys for different blocks in a block based cipher with low storage capacity is discussed. Although different authors propose different labeling techniques for cryptosystems none of them discuss metrics to prove their efficacy.We use the concept of entropy to establish the randomness of our key generation technique.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Key Generation in Cryptography Using Radio Path Coloring

Dhanyashree,

Meera,

Broumi

2024

IEEE Access

View full text Add to dashboard Cite

An L(p 1 , p 2 , p 3 , . . . , p m )labeling of a graph G is an assignment of positive integers to the vertices of G such that the difference in the labels assigned to the vertices at distance i should be at least p i . The particular case of p 1 = d, p 2 = d − 1, p 3 = d − 2, . . . , p d = 1 where d is the diameter of the graph, was known as the radio labeling of G. The minimum value of the maximum integer used in any feasible radio labeling of G was called as radio number of G denoted by rn(G). The idea of radio path coloring was conceived to ensure secure communication in networks. If there exists a path between each pair of vertices, such that, the labeling in that path is an L(p 1 , p 1 − 1, p 1 − 2, . . . , 1)− labeling, then such a labeling was called an L(p 1 , p 1 −1, p 1 −2, . . . , 1)− path coloring or a radio path coloring of G. The minimum value of the largest label used in such a coloring was called as the radio path connection number. Earlier researchers have studied the case of p 1 = 2 for different classes of graphs. We focus on the more general case of p 1 ≥ 3 and obtain an upper bound on the radio connection number k p1c (G), of any semi-Hamiltonian graph G. An algorithm to obtain the radio path coloring of a Semi-Hamiltonian graph G is also discussed here and the same is used to generate keys for secure communication in cryptography. INDEX TERMS Cryptography, radio labeling, path coloring I. INTRODUCTION

show abstract

Section: Figure 1: Entropy Analysismentioning

confidence: 99%

mentioning

confidence: 99%

Key Generation in Cryptography Using Radio Path Coloring

Dhanyashree,

Meera,

Broumi

2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The lower bound of 𝑟𝑣𝑎𝑐(𝐺) that found by Marsidi, et al is as follows. Remark 1 [16] Let 𝐺 be a connected graph, 𝑟𝑣𝑎𝑐(𝐺) ≥ 𝑟𝑣𝑐(𝐺).…”

Section: Preliminariesmentioning

confidence: 99%

“…The term cryptosystem is commonly used to refer to public key techniques; however, for symmetric key techniques, both "cipher" and "cryptosystem" are used. The strength of cryptography protocols relies on the encryption-decryption keys management: how to protect the keys from disclose to unauthorized parties [16].…”

Section: Introductionmentioning

confidence: 99%

Developing A Secure Cryptosystem with Rainbow Vertex Antimagic Coloring of Cycle Graph

Marsidi

2022

J. Mat. Mantik

View full text Add to dashboard Cite

An edge labeling of graph G is a function g from the edge set of graph G to the first natural numbers up to the number of the edge set. Graph G admits a rainbow vertex antimagic coloring if, for any two vertices, there is a path with different colors of all internal vertices. The vertex color of graph G is assigned by vertex weight. The vertex weight of graph G is obtained by summing all edge labels that incident with that vertex. The rainbow vertex antimagic connection number of graph G, denoted by rvac(G) is the smallest number of different colors induced by rainbow vertex antimagic coloring. In this research, we determine the upper bound of the rainbow vertex antimagic connection number (rvac) on a cycle graph (Cn) and create a secured cryptosystem using a modified Affine Cipher based on rainbow vertex antimagic coloring.

show abstract

Stream-keys generation based on graph labeling for strengthening Vigenere encryption

Cited by 2 publications

References 23 publications

Key Generation in Cryptography Using Radio Path Coloring

Key Generation in Cryptography Using Radio Path Coloring

Developing A Secure Cryptosystem with Rainbow Vertex Antimagic Coloring of Cycle Graph

Contact Info

Product

Resources

About