Discrete chaotic cryptography using external key

Pareek, Navneet; Patidar, Vinod; Sud, K. K.

doi:10.1016/s0375-9601(03)00122-1

Cited by 221 publications

(110 citation statements)

References 20 publications

Supporting

Mentioning

110

Contrasting

Order By: Relevance

“…Many researches in the field of using chaotic maps in cryptography have been developed [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. In [2], a cryptosystem, with a symmetric key block cipher, used an external key of variable length (maximum 128-bits) to generate system parameters and initial conditions of the chaotic map.…”

Section: Related Workmentioning

confidence: 99%

“…In [2], a cryptosystem, with a symmetric key block cipher, used an external key of variable length (maximum 128-bits) to generate system parameters and initial conditions of the chaotic map. The ciphertext depends on the secret key only; so to make it robust against any reasonable attack, it uses the feedback technique.…”

Section: Related Workmentioning

confidence: 99%

“…Discrete maps usually take the form of iterated functions. Their properties are similar to confusion and diffusion cryptography properties; so they have been used to build good cryptosystems [1][2][3]. Furthermore, these properties make chaotic cryptosystems robust against statistical attacks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cryptography Using Multiple Two-Dimensional Chaotic Maps

Abuhaiba¹,

AlSallut²,

Hejazi³

et al. 2012

IJCNIS

View full text Add to dashboard Cite

-In this paper, a symmetric key block cipher cryptosystem is proposed, involving multiple twodimensional chaotic maps and using 128-bits external secret key. Computer simulations indicate that the cipher has good diffusion and confusion properties with respect to the plaintext and the key. Moreover, it produces ciphertext with random distribution. The computation time is much less than previous related works. Theoretic analysis verifies its superiority to previous cryptosystems against different types of attacks.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Cryptography Using Multiple Two-Dimensional Chaotic Maps

Abuhaiba¹,

AlSallut²,

Hejazi³

et al. 2012

IJCNIS

View full text Add to dashboard Cite

show abstract

“…Otherwise, a brute-force attack can be performed on the reduced space of control parameters and initial condition values with a lower computational cost than the one on the key space. A cryptosystem with this problem was introduced in [87] and was later cryptanalyzed in [9].…”

Section: Case Study 824 ([29])mentioning

confidence: 99%

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Álvarez

Amigó

Arroyo

et al. 2011

Studies in Computational Intelligence

View full text Add to dashboard Cite

The idea of using chaotic transformations in cryptography is explicit in the foundational papers of Shannon on secrecy systems (e.g., [96]). Although the word "chaos" was not minted till the 1970s [71], Shannon clearly refers to this very concept when he proposes the construction of secure ciphers by means of measure-preserving, mixing maps which depend 'sensitively' on their parameters. The implementation of Shannon's intuitions had to wait till the development of Chaos Theory in the 1980s. Indeed, it was around 1990 when the first chaos-based ciphers were proposed (e.g., [78], [46]). Moreover, in 1990 chaos synchronization [91] entered the scene and shortly thereafter, the first applications to secure communications followed [56,37]. The idea is remarkably simple: mask the message with a chaotic signal and use synchronization at the receiver to filter out the chaotic signal. The realization though had to overcome the desynchronization induced by the message itself. After this initial stage, the number of proposals which exploited the properties of chaotic maps for cryptographical purposes, grew in a spectacular way.

show abstract

“…Some of them are based on one-dimensional chaotic maps and are applied to data sequence or document encryption [5,6]. For image encryption, two-dimensional (2D) or higher-dimensional chaotic maps are naturally employed as the image can be considered as a 2D array of pixels [7][8][9].…”

Section: Introductionmentioning

confidence: 99%

Confusion Algorithm based on 3-D Chaotic Map System for Securing the Colored Images

AbuZaid¹,

Demba²,

Al-Refaiy³

2013

IJCA

View full text Add to dashboard Cite

In this paper, confusion algorithm based on three dimension chaotic map system will be proposed and presented. Chen's chaotic system is 3-D chaotic map system, which will be used to obtain a proposed confusion algorithm. A proposed encryption algorithm will be designated as CA3DCS. It will be applied on two different color's frequencies colored-images. A proposed algorithm (CA3DCS), which Contains Confusion procedure based on Chen 's chaotic system is used to shuffle the positions of pixels of the colored plain-image. CA3DCS will be applied on all color's channels of the image; Red, Green, and Blue. The expectant results of several experiments, statistical analysis, key sensitivity tests, and information entropy analysis will show that the proposed confusion algorithm (CA3DCS) is a good algorithm to provides an efficient and secure way for confusing or encrypting the colored images.

show abstract

Discrete chaotic cryptography using external key

Cited by 221 publications

References 20 publications

Cryptography Using Multiple Two-Dimensional Chaotic Maps

Cryptography Using Multiple Two-Dimensional Chaotic Maps

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Confusion Algorithm based on 3-D Chaotic Map System for Securing the Colored Images

Contact Info

Product

Resources

About