Cryptanalysis of a New Chaotic Cryptosystem Based on Ergodicity

Arroyo, David; Álvarez, Gonzalo; Li, Shujun; Li, Chengqing; Fernández, Verónica

doi:10.1142/s0217979209049966

Cited by 22 publications

(25 citation statements)

References 11 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the initial step has cascaded influence on the succeeding steps, the attack is totally failed under the given secret key. 10,11,12,13,9,15,14], and r = 4.…”

Section: Real Performance Of Solak's Chosen-ciphertext Attackmentioning

confidence: 99%

On the cryptanalysis of Fridrich's chaotic image encryption scheme

Xie

et al. 2017

Signal Processing

Self Cite

251

View full text Add to dashboard Cite

Utilizing complex dynamics of chaotic maps and systems in encryption was studied comprehensively in the past two and a half decades. In 1989, Fridrich's chaotic image encryption scheme was designed by iterating chaotic position permutation and value substitution some rounds, which received intensive attention in the field of chaos-based cryptography. In 2010, Solak et al. proposed a chosen-ciphertext attack on the Fridrich's scheme utilizing influence network between cipher-pixels and the corresponding plain-pixels. Based on their creative work, this paper scrutinized some properties of Fridrich's scheme with concise mathematical language. Then, some minor defects of the real performance of Solak's attack method were given. The work provides some bases for further optimizing attack on the Fridrich's scheme and its variants.

show abstract

“…As the initial step has cascaded influence on the succeeding steps, the attack is totally failed under the given secret key. 10,11,12,13,9,15,14], and r = 4.…”

Section: Real Performance Of Solak's Chosen-ciphertext Attackmentioning

confidence: 99%

On the cryptanalysis of Fridrich's chaotic image encryption scheme

Xie

et al. 2017

Signal Processing

Self Cite

251

View full text Add to dashboard Cite

show abstract

“…Ref. [8], [9] gives an overview of some of the chaos based encryption techniques and their cryptanalysis. The proposed algorithm (ICKBA) provides high security with very low computational complexity.…”

Section: Improved Ckba Encryption (Ickba)mentioning

confidence: 99%

An expeditious chaos based digital image encryption algorithm

Raj

George

Deepthi

2012

2012 1st International Conference on Recent Advances in Information Technology (RAIT)

View full text Add to dashboard Cite

Chaos based encryption techniques have been gaining immense attraction for the past few years with a view of enhancing security coupled with reduction in computational complexity. This paper explores the drawbacks of chaotic key based algorithm (CKBA) which was primarily designed for monochrome images. We put forth an improved chaotic key based image encryption algorithm for monochrome and color images. The new algorithm was subjected to the known forms of attack and has been found resistant to the same

show abstract

“…This problem is specially relevant when the design of the cryptosystem is based on a dynamical system with chaotic behavior only for a set of disjoint parts of the whole space of the control parameters. This is the case of the logistic map and the Hénon map, which have been used in [93,73,106] and in [34] respectively without a thorough analysis of their dynamics, as we have pinpointed in [29,27,25,26]. As a conclusion, it is highly advisable to use dynamical systems with chaotic behavior for all the values of the control parameter(s).…”

Section: Master Systemmentioning

confidence: 99%

“…In addition, the theory of symbolic dynamics may also reveal the weakness of a cryptosystem if the ciphertext allows getting the symbolic sequences of the underlying chaotic system. In [25] we have shown through a chosen-ciphertext attack how to derive the symbolic sequence of the logistic map driving the encryption procedure defined in [106]. Once we have the symbolic sequence, we can infer the values of the control parameter and initial condition of the underlying logistic map according to the theory of applied symbolic dynamics described in [3].…”

Section: Problems With the Encryption Architecturementioning

confidence: 99%

“…Similarly, because the encryption/decryption procedure is composed of j repeated cycles, the encryption speed will also become slower if the value of j increases. To be more precise, for a given plain-image, we can expect the existence of the following bi-linear relationship between the encryption/decryption time (EDT) and the values of n and j: 25) where c corresponds to the common operations consumed on each chaotic iteration, d 0 to the operations performed in each cycle excluding those about chaotic iterations, and d 1 to those operations performed on the initialization process and the postprocessing after all the j cycles are completed. In addition, because λ is just the control parameter of the chaotic map, it is expected that EDT will be independent of its value.…”

Section: Case Study 824 ([29])mentioning

confidence: 99%

See 1 more Smart Citation

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Álvarez

Amigó

Arroyo

et al. 2011

Studies in Computational Intelligence

Self Cite

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

Cryptanalysis of a New Chaotic Cryptosystem Based on Ergodicity

Abstract: This paper analyzes the security of a recent cryptosystem based on the ergodicity property of chaotic maps. It is shown how to obtain the secret key using a chosenciphertext attack. Some other design weaknesses are also shown.

Cited by 22 publications

References 11 publications

On the cryptanalysis of Fridrich's chaotic image encryption scheme

On the cryptanalysis of Fridrich's chaotic image encryption scheme

An expeditious chaos based digital image encryption algorithm

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Contact Info

Product

Resources

About