On the cryptanalysis of Fridrich's chaotic image encryption scheme
arXiv:1609.05352 · doi:10.1016/j.sigpro.2016.10.002
Abstract
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 \textit{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.
7 pages, 7 figures, Signal Processing, 2017
References in corpus (1)
Cited by in corpus (5)
- Cryptanalysis of a Classical chaos-based cryptosystem with some quantum cryptography features
- Design and ARM-embedded implementation of a chaotic map-based multicast scheme for multiuser speech wireless communication
- When an attacker meets a cipher-image in 2018: A Year in Review
- Universal chosen-ciphertext attack for a family of image encryption schemes
- Randomness Evaluation of a Genetic Algorithm for Image Encryption: A Signal Processing Approach