Symmetric Key Encryption using Iterated Fractal Functions

Agarwal, Shafali

doi:10.5815/ijcnis.2017.04.01

Cited by 11 publications

(7 citation statements)

References 26 publications

(23 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later, in 2004, an approach was suggested to use fractal based encryption/decryption key and USA navy published the patent for the same [35]. There are numerous fractal functions, that can be employed in many applications such as Mandelbrot set, Julia set and more [36]. In this paper a conjugate transcendental fractal function is used to create a set of initial values.…”

Section: Related Workmentioning

confidence: 99%

A Chaotic Cryptosystem using Conjugate Transcendental Fractal Function

Agarwal¹,

Plano²

2019

IJCNIS

Self Cite

View full text Add to dashboard Cite

A cryptosystem designed by using the combined features of fractal function and chaotic map, provides a secure and real time encryption environment. In this paper, a 2D-chaotic map is employed to create a chaotic key sequence to comply with the requirement of the key sensitivity. The set of initial values of the chaotic map has derived by iterating a conjugate transcendental fractal function (CTFF) i.e. +1 = (sin(2)) +. The fractal function produced three sets of initial values after iterating it using Picard, Mann, and Ishikawa iteration methods. Resultantly, three chaotic key sequences will be generated by executing 2D Sine Tent composite map (2D-STCM) for each set of initial values. Afterwards, perform zigzag scanning to each key stream to decorrelate the adjacent image pixels and combined them using XOR operation. By using a different summation of plain image pixels for each pixel encryption, improves the cryptosystem resistant against known/chosen-plaintext attack. Moreover, an encryption of a plain image pixel achieved using corresponding key sequence pixel and a previously ciphered pixel value. The proposed encryption/decryption scheme is evaluated using key space analysis, key sensitivity analysis, differential analysis and other statistical analyses. The performance result indicates the given scheme is efficient and reliable to be used with great potential for a secure image transmission application.

show abstract

Section: Related Workmentioning

confidence: 99%

A Chaotic Cryptosystem using Conjugate Transcendental Fractal Function

Agarwal¹,

Plano²

2019

IJCNIS

Self Cite

View full text Add to dashboard Cite

show abstract

“…Some of the described algorithms have been mentioned earlier in previous articles of the author [1][2][3][4][5][6][7], but some names, designations, definitions, steps and actions may be partially or completely different, due to constant research and development of this "family" of algorithms.…”

Section: Introductionmentioning

confidence: 99%

Description of Algorithms for Balancing Numerical Matrices and Their Division Into Hierarchical Levels According to Their Type and Complexity

Khanas

Borecki

2021

IAPGOS

View full text Add to dashboard Cite

This article describes a set of algorithms for so-called balancing of numerical matrices, which were developed by the author. Each section consists of several algorithms that are divided into different levels. The order of these levels depended on the chronology of the creation of certain algorithms. Chronology also affected the complexity of these balancing algorithms, so it can be argued that the algorithms are described in order from the simplest level to the most complex. It is important to emphasize that the purpose of the article is to describe the actions on matrices that determine the balancing algorithm of a certain level, and practical application will be the next step.

show abstract

“…Cryptography first appeared applying a symmetric algorithm or the so-called secret key algorithm or secret cipher. Where, this algorithm also has the same encryption key as the decryption key [4].…”

Section: Introductionmentioning

confidence: 99%

Simulations of text encryption and decryption by applying vertical bit rotation algorithm

Pertiwi¹,

Djuniadi

2021

joscex

View full text Add to dashboard Cite

Cryptography is the study of hiding text and numbers in the form of codes. Vertical Bit Rotation (VBR) is one of the most widely implemented cryptographic algorithms as a one-way hash function that simplifies the encryption process with a high degree of difficulty in decryption. The purpose of this study is to apply VBR hash algorithm modeling to binary value characters with bit rotation keys 10, 11, 7, 3, 2, 7, 5, and 4. Thus, generating a passcode. The results of the encryption simulation show the code in the form of letters and characters, then the result of the decryption with the opposite rotation to the encryption process returns the value from ciphertext to plaintext based on ASCII characters. Cryptographic algorithms are applied to avoid cryptanalytic experiments in opening encryption codes.

show abstract

Symmetric Key Encryption using Iterated Fractal Functions

Cited by 11 publications

References 26 publications

A Chaotic Cryptosystem using Conjugate Transcendental Fractal Function

A Chaotic Cryptosystem using Conjugate Transcendental Fractal Function

Description of Algorithms for Balancing Numerical Matrices and Their Division Into Hierarchical Levels According to Their Type and Complexity

Simulations of text encryption and decryption by applying vertical bit rotation algorithm

Contact Info

Product

Resources

About