Encrypting and decrypting algorithms using strong face graph of a tree

Kuppan, R.; Shobana, L.; Cangül, İsmaıl Nacı

doi:10.1080/23799927.2020.1807606

Cited by 2 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The cryptography concepts depend on graph labeling techniques. One can find in [6,10] the application of labeled graphs in cryptography. Graph labeling research is becoming popular and interesting nowadays.…”

Section: Introductionmentioning

confidence: 99%

k-Zumkeller graphs through splitting of graphs

Kalaimathi

Balamurugan

2023

Proyecciones (Antofagasta)

View full text Add to dashboard Cite

Let G = (V,E) be a simple graph with vertex set V and edges set E. A 1−1 function f : V → N is said to induce a k-Zumkeller graph G if the induced edge function f ∗ : E → N defined by f ∗(xy) = f(x)f(y) satisfies the following conditions: 1. f ∗(xy) is a Zumkeller number for every xy ∈ E. 2. The total distinct Zumkeller numbers on the edges of G is k. In this article, we compute k-Zumkeller graphs through the graph splitting operation on path, cycle and star graphs.

show abstract

Section: Introductionmentioning

confidence: 99%

k-Zumkeller graphs through splitting of graphs

Kalaimathi

Balamurugan

2023

Proyecciones (Antofagasta)

View full text Add to dashboard Cite

show abstract

“…However, this analysis did not extend to security implications. Distinct cryptographic strategies using face anti-magic labelling were unveiled by Kuppan et al [17], while Rao et al [18] advanced a novel image encryption approach through visual cryptography, leveraging the Least Significant Bit (LSB) technique in the spatial domain. In another study, Rama et al [19] augmented the use of CA for DES key generation, primarily benefitting from the randomness induced by CA rule 30, although a limitation was observed in the reduced key size.…”

Section: Introductionmentioning

confidence: 99%

A Novel Approach of 1-D Cellular Automata in Cryptosystem

Kukaram,

Ramasamy

2023

MMEP

View full text Add to dashboard Cite

Cryptosystems worldwide employ techniques for the encryption and decryption of sensitive data, relying extensively on secret keys. In this context, the generation of a randomized, secured secret key and its size hold paramount significance in ensuring confidentiality, data integrity, and resistance to a plethora of security attacks, rendering it arduous for potential intruders to predict key sequences. This study aims to generate the highly secured randomized secret key, minimize the time complexity and ensure efficiency of the cryptosystem. In the key generation methodology presented, a novel approach was introduced, taking into account the receiver's credentials and employing the elementary cellular automata (CA). Rule 150 of CA was strategically leveraged to generate a secret key, undergoing numerous iterations to bolster security, intricacy, and to compound the predictability challenge of the key. Python was the chosen medium for the implementation of the proposed model. Time complexity was rigorously evaluated, and a comparative analysis was conducted against established cryptographic algorithms, notably Rivest-Shamir-Adleman (RSA) and Advanced Encryption Standard (AES), to ascertain efficiency. Subsequently, a frequency analysis, underpinned by a letter frequency distribution chart, was undertaken to confirm the randomness of the resultant ciphertext (CT). To further validate the robustness of the proposed model, security assessments encompassing brute force attacks, CT attacks, known plaintext (PT) attacks, and chosen PT attacks were meticulously examined. Cumulative findings corroborate the heightened security and efficiency of the proposed model in contrast to its predecessors. Anticipated future research horizons include the potential incorporation of CA in domains such as image and video encryption, blockchain technology, cryptocurrency, and digital signatures, aiming to cultivate superior security infrastructures.

show abstract

Encrypting and decrypting algorithms using strong face graph of a tree

Cited by 2 publications

References 1 publication

k-Zumkeller graphs through splitting of graphs

k-Zumkeller graphs through splitting of graphs

A Novel Approach of 1-D Cellular Automata in Cryptosystem

Contact Info

Product

Resources

About