Source-linked AI summary
On the cryptanalysis of Fridrich's chaotic image encryption scheme
Eric Yong Xie, Chengqing Li, Simin Yu, Jinhu Lü
TL;DR
Fridrich’s chaotic image encryption scheme and its influence-network cryptanalysis motivate this study of the scheme’s mathematical properties and attack performance. The paper reports minor defects in Solak’s chosen-ciphertext attack and identifies bases for further optimization of attacks on Fridrich’s scheme and variants.
Problem
The security implications and cryptanalytic properties of Fridrich’s influential iterated permutation-and-substitution architecture require closer examination, including the real performance of Solak’s chosen-ciphertext attack.
Method
The paper formulates properties of Fridrich’s scheme with concise mathematical and matrix-based analysis, then evaluates Solak’s attack and its extension to Chen’s scheme.
Results
The analysis reports minor defects in Solak’s chosen-ciphertext attack method and examines influence-path properties underlying the attack.
Takeaways & Limitations
The findings provide bases for further optimizing chosen-ciphertext attacks on Fridrich’s scheme and its variants.
Takeaways & Limitations
XOR can cancel multiple influence paths, so some paths cannot be recovered; an error in one influence-matrix element may disable subsequent attack steps.
Abstract
from arXiv · showhide
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.
1. Introduction
Chaos-based encryption has attracted sustained research, but structural properties of chaotic systems can enable cryptanalysis. This paper examines Fridrich’s influential scheme and evaluates defects in Solak’s chosen-ciphertext attack and its extension.
- Chaotic dynamics have been studied as a basis for designing secure and efficient encryption schemes since the first chaos-based scheme was proposed in 1989.
- Short periods arising from small computing precision were identified as a potential security compromise in an early chaos-based scheme.
- Position permutation-only encryption can be broken with O(⌈logL(H · W)⌉) known/chosen plaintexts and O(H · W · ⌈logL(H · W)⌉) computation.
- Iterating position permutation and value substitution for sufficient rounds was suggested to strengthen encryption against attacks.
- The paper summarizes Fridrich’s scheme using complex-network methods, evaluates Solak’s chosen-ciphertext attack, and briefly assesses its extension to Chen’s scheme.
2. Fridrich’s chaotic image encryption scheme
Fridrich’s scheme encrypts a grayscale image by repeatedly applying position permutation and nonlinear value substitution. Encryption repeats these steps for a predefined number of rounds, while decryption reverses their order and uses the inverse permutation.
- The plaintext is a grayscale image of size H × W represented as a sequence of HW values in Z256.
- The encryption framework first applies a position permutation represented by W and then performs value substitution for each pixel.
- Value substitution uses modular addition, a fixed nonlinear function g: Z256 → Z256, a pseudo-random sequence H, and a predefined parameter c.
- The scheme repeats permutation and substitution for r−1 additional times after the initial application, where r is a predefined positive integer.
- Decryption reverses the two main encryption steps, replaces W with its inverse, and replaces the substitution equation with its inverse form.
3. Cryptanalysis
The paper reformulates influence relations in Fridrich’s scheme using matrix theory, states properties governing influence paths, and evaluates weaknesses in Solak’s attack and its extension to Chen’s scheme.
- 3.1. Some properties of Fridrich’s scheme: Property 1 characterizes an influence path through the positive entries of (bT)^r.The relevant plain-pixel indices are those j satisfying (bT)^r(z, j) > 0.
- 3.1. Some properties of Fridrich’s scheme: Matrix multiplication represents permutation and substitution influence relations between cipher-pixels and plain-pixels across encryption rounds.The paper identifies positive matrix entries with possible influence paths, while noting modulo operations may cancel influence.
- 3.1. Some properties of Fridrich’s scheme: Property 2 shows that, under consecutive permutation indices, one influence-set difference is contained in another corresponding set.This relation supports comparisons among rows of the influence matrix.
- 3.1. Some properties of Fridrich’s scheme: Property 3 gives conditions under which one row of (bT)^r has 2^(r−1) non-zero elements and the other rows have 2^r.The proof uses three patterns for reducing incoming influence paths and excludes them under the stated conditions.
- 3.3. Real performance of Solak’s chosen-ciphertext attack: Solak’s attack can fail when its first row estimate is incorrect, because the resulting error cascades through subsequent search steps.For W = [1, 3, 5, 7, 2, 4, 6, 8, 0, 10, 11, 12, 13, 9, 15, 14] and r = 4, the least-populated row incorrectly suggests w(9) = 0.
- 3.4. Real performance of extension of Solak’s attack to Chen’s scheme: XOR can cancel multiple influence paths, making the recovered influence matrix incomplete and potentially disabling later attack steps.In the reported example, changing every cipher-pixel to one leaves six influence paths unrecovered, motivating additional cipher-images.
4. Conclusion
The paper formulates properties of Fridrich’s scheme using matrix theory and identifies minor defects in Solak’s chosen-ciphertext attack, motivating further attack optimization.
- Matrix theory is used to formulate properties of Fridrich’s chaotic image encryption scheme.
- The analysis reports minor defects in Solak’s chosen-ciphertext attack method.
- Further work should reduce chosen-ciphertext requirements and computational complexity, and study known/chosen-plaintext attacks.