The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index; none of the 10 sources its claims cite is checked for support yet.
Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks
Open accessAbstract
In [Pattern Recognition Letters, in press, doi:10.1016/j.patrec.2009.11.008], an image scrambling encryption algorithm of pixel bit based on chaos map was proposed. Considering the algorithm as a typical binary image scrambling/permutation algorithm exerting on plaintext of size M � (8N), this paper proposes a novel optimal method to break it with some known/chosen-plaintexts. The spatial complexity and computational complexity of the attack are only O(32 � MN) and O(16 � n0 � MN) respectively, where n0 is the number of known/chosen-plaintexts used. The method can be easily
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper gives an optimal known/chosen-plaintext cryptanalysis of a chaos-based pixel-bit image permutation cipher and extends it to any permutation-only multimedia cipher. It recovers the equivalent permutation matrix with low spatial and computational complexity and reports experimental recovery on 256×256 images.
Key findings
- For the binary image permutation algorithm on plaintext size \(M \times (8N)\), the attack needs only \(O(32 \cdot MN)\) spatial complexity and \(O(16 \cdot n_0 \cdot MN)\) computational complexity, where \(n_0\) is the number of known/chosen plaintexts.
- For any permutation-only scheme on size \(M \times N\) with \(L\) value levels, the attack achieves \(O(MN)\) spatial complexity and \(O(\lceil \log_L(MN)\rceil \cdot MN)\) computational complexity.
- For 256×256 images, the known-plaintext threshold becomes \(n_0 > \lceil \log_2(2^{19}-1)\rceil = 19\); with 20 known plain-images, the recovered “Peppers” image had \(23509/65536 \approx 35.8\%\) correct pixels but most visual information recovered, and performance was good when \(n_0 \ge 20\).
- Exact chosen-plaintext recovery requires \(n_c = \lceil \log_2(8MN)\rceil = 3 + \lceil \log_2(MN)\rceil\) chosen plain-images; the paper also notes weaknesses including weak Logistic-map randomness, failure on all-zero/all-255 images, plaintext insensitivity, equivalent subkeys \(x_0\) and \(1-x_0\), unchanged bit histogram, and low efficiency.
Methods
- The cipher is represented as an \(M \times (8N)\) permutation matrix \(W\); the attack constructs a binary tree from known/chosen plaintext–ciphertext pairs to recover \(W\), then extends this to a multi-branch tree for general \(L\)-level permutation-only schemes.
- Experiments use randomly selected natural images of size 256×256, with an illustrated key \((x_0,\mu,m,n,T)=(0.2009,3.98,20,51,4)\) and recovered “Peppers” images using estimates \(W_{20}\) and \(W_{25}\), plus a \(3\times3\) median filter.
- The analysis derives recovery thresholds under a uniform independent-bit assumption and reports spatial/computational complexity for the binary and general cases.
Limitations
- The paper states no explicit limitations section.
- Evident from the text: the known-plaintext threshold analysis assumes each bit is uniformly distributed over \(\{0,1\}\) and independent; the authors note natural-image redundancy causes flat performance slopes for \(n_0 \ge 25\) and has two opposite influences on breaking.
- Evident from the text: experimental validation is mainly on 256×256 natural images with one illustrated secret key, and the attack inherently requires known or chosen plaintext–ciphertext pairs.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
25 Own interpretation · 9 No full text of the sources · 9 No basis given · 2 Own result · 1 Sources not found
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The corresponding spatial complexity and computational complexity are only O ( MN ) and O ( ⌈ log L ( MN ) ⌉ · MN ) respectively.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: The attacker can obtain some known or chosen plaintexts together with their corresponding ciphertexts encrypted under the same secret key.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is found that most visual information contained in the original plain-image has been recovered in Fig. 2c), although only 23509 / 65536 ≈ 35 . 8% of plain pixels are correct in value.”
plaindirectSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“spatial complexity and computational complexity of the attack are O ( MN ) and O ( n 0 · MN ), respectively.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The corresponding spatial complexity and computational complexity are only O ( MN ) and O ( ⌈ log L ( MN ) ⌉ · MN ) respectively.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: The attacker can obtain some known or chosen plaintexts together with their corresponding ciphertexts encrypted under the same secret key.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“One can see that the breaking performance is good when n 0 ≥ 20.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The spatial complexity and computational complexity of the attack are only O (32 · MN ) and O (16 · n 0 · MN ) respectively, where n 0 is the number of known/chosenplaintexts used.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: The attacker can obtain some known or chosen plaintexts together with their corresponding ciphertexts encrypted under the same secret key.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is found that the complex intersection operations can be avoided by extending the idea proposed in Sec. 3.1, namely constructing a multi-branch tree”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The spatial complexity and computational complexity of the attack are only O (32 · MN ) and O (16 · n 0 · MN ) respectively, where n 0 is the number of known/chosenplaintexts used.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- The authors state this as an assumption: The attacker can obtain some known or chosen plaintexts together with their corresponding ciphertexts encrypted under the same secret key.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It can also be observed that the slopes of the three lines shown in Fig. 5 are very flat when n 0 ≥ 25.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“spatial complexity and computational complexity of the attack are O ( MN ) and O ( n 0 · MN ), respectively.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- It may state two separate claims as one. 7
- Probably not a substantial claim. 2
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Fail to encrypt images of fixed value zero or 255”
- Also stated in: § 3.2. Chosen-plaintext attack · p. 7 · plain
“For both the two images, all elements of the corresponding intermediate matrix B ∗ are the same, which make all the encryption procedures do nothing.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § 3.2. Chosen-plaintext attack · p. 7 · plain
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Insensitivity with respect to changes of plaintext”
- Also stated in: § 3.2. Chosen-plaintext attack · p. 8 · plain
“Unfortunately, the image permutation algorithm under study does not consider this property at all.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § 3.2. Chosen-plaintext attack · p. 8 · plain
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Although the histogram on plain-byte is changed by the image permutation algorithm under study, the one on plain-bit keep unchanged, which make the cipher-image still reveal some information of the plain-image.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Since that the secret permutation does not change the values of the permuted elements, a general algorithm was proposed in [20] for obtaining the permutation matrix by comparing the values of the elements of some plaintexts and the corresponding ciphertexts.”
What the sources say
- Not checked — no full text of the sourcecites [20] Li, 2008, A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks, Signal Processing: Image Communication source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
In the paper
“Substitute n 0 with ⌈ log L ( MN ) ⌉ , the complexity becomes O ( ⌈ log L ( MN ) ⌉· MN ), which is lower much than O ( ⌈ log L ( MN ) ⌉ · MN 2 ), the whole attack complexity estimated in [20].”
What the sources say
- Not checked — no full text of the sourcecites [20] Li, 2008, A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks, Signal Processing: Image Communication source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Obviously, the spatial complexity and the computational complexity of the proposed knownplaintext attack are only O (32 · MN ) and O (16 · n 0 · MN ), respectively.”
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“due to strong redundancy in natural images, two pixel values are close to each other with a probability larger than the average one, hence many incorrectly recovered pixels are close to their true values with a probability larger than the average one also.”
plaindirectSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The generation method of permutation matrixes T M and T N make the computational complexity of the image permutation algorithm under study is O ( M · (8 N ) 2 ), which is even much larger than that of DES.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Since that the secret permutation does not change the values of the permuted elements, a general algorithm was proposed in [20] for obtaining the permutation matrix by comparing the values of the elements of some plaintexts and the corresponding ciphertexts.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
The authors state this as an assumption.
The attacker can obtain some known or chosen plaintexts together with their corresponding ciphertexts encrypted under the same secret key.
“The known-plaintext attack is an attack model for cryptanalysis where the attacker has some samples of both the plaintext and the corresponding ciphertext and make use of them to reveal secret information, such as secret keys and/or its equivalent ones.”
“this paper proposes a novel optimal method to break it with some known/chosen-plaintexts.”
The authors state this as an assumption.
Each element in B is uniformly distributed over {0,1}.
“To simplify the analyses, we assume that each element in B distributes uniformly over { 0 , 1 } , and any two elements are independent of each other.”
The authors state this as an assumption.
Any two elements in B are independent of each other.
“To simplify the analyses, we assume that each element in B distributes uniformly over { 0 , 1 } , and any two elements are independent of each other.”
The paper relies on this without support.
Decryption is acceptable when every bit is correctly determined with probability greater than 0.5.
“Generally speaking, when every bit is determined correctly with a probability larger than a half, namely p b > 0 . 5, the decryption will be acceptable.”
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 3.1. Known-plaintext attack · p. 4
“Search for all nodes whose third item is greater than one, namely, both the corresponding two sets have more than one elements;”
§ 3.1. Known-plaintext attack · p. 3
“every node includes five components in order: a pointer holding address of the left child node, PT L ; two sets containing some entry positions of plain-image and cipher-image, respectively; cardinality of one of the two sets; a pointer holding address of the right child node, PT R .”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 3.1. Known-plaintext attack · p. 5
“The results of two images shown in Figs. 2c) and d) with a 3 × 3 median filter are shown in Figs. 4a) and b), respectively.”
§ 3.1. Known-plaintext attack · p. 6
“Figure 4: The enhanced results of applying a 3 × 3 median filter to the two recovered plain-images: a) the image shown in Fig. 2c); b) the image shown in Fig. 2b).”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 3.1. Known-plaintext attack · p. 4
“where p b = 1 1+(8 MN -1) / 2 n 0 , i = 0 ∼ 8. Generally speaking, when every bit is determined correctly with a probability larger than a half, namely p b > 0 . 5, the decryption will be acceptable.”
§ 3.1. Known-plaintext attack · p. 4
“In this case, Eq. (5) become n 0 > ⌈ log 2 (2 19 -1) ⌉ = 19.”
Citations
Cites
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119 · cited 1×
“unately, most of them have been found to be insecure to dierent extents from the viewpoint of modern cryptography [8{16]. For more discussion on chaos-based image encryption schemes, please refer to [17, 18]. In [19], an image permutation algorithm was proposed by scrambling/permuting binary bit of every pixel with ps…”
BackgroundA symmetric image encryption scheme based on 3D chaotic cat maps
Chen, G., Mao, Y., & Chui, C. K. (2004) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2003.12.022 · Cited by 2,092 · cited 1×
“Due to the subtle similarities between cryptography and chaos, a great number of image encryption schemes based on chaos have been proposed in the paste decade [1, 2, 3, 4, 5].”
BackgroundRukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867
Partial encryption of compressed images and videos
Cheng, H., & Li, X. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.852023 · Cited by 517 · cited 1×
“Again, this cryptanalysis paper proves that the security of a good image encryption scheme should rely on well combination of traditional cryptography and special properties of image data, like the schemes proposed in [22, 23, 24].”
BackgroundLi, S., Li, C., Chen, G., Bourbakis, N. G., & Lo, K.-T. (2008) · Signal Processing: Image Communication · doi:10.1016/j.image.2008.01.003 · Cited by 324 · cited 5×
“Depending on the fact that the secret permutation does not change the values of the permuted elements, a general algorithm was proposed in [18] for obtaining the permutation matrix by comparing the values of the elements of some plaintexts and the corresponding ciphertexts.”
BackgroundMethodInfluentialSelf-citationImage scrambling encryption algorithm of pixel bit based on chaos map
Ye, G. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.11.008 · Cited by 302 · cited 1×
“In [17], an image permutation algorithm was proposed by scrambling/permuting binary bit of every pixel with pseudo-random number sequence generated by chaotic logistic map.”
MethodA new encryption algorithm for image cryptosystems
Chang, C., Hwang, M.-S., & Chen, T.-S. (2001) · Journal of Systems and Software · doi:10.1016/s0164-1212(01)00029-2 · Cited by 270 · cited 1×
“Again, this cryptanalysis paper proves that the security of a good image encryption scheme should rely on well combination of traditional cryptography and special properties of image data, like the schemes proposed in [22, 23, 24].”
Background(2004) · CRC Press eBooks · doi:10.1201/9781420038262 · Cited by 247
A novel image encryption algorithm based on self-adaptive wave transmission
Liao, X., Lai, S., & Zhou, Q. (2010) · Signal Processing · doi:10.1016/j.sigpro.2010.03.022 · Cited by 235 · cited 1×
“Unfortunately, most of them have been found to be insecure of different extents from the viewpoint of modern cryptography [6, 7, 8, 9, 10, 11, 12, 13, 14].”
BackgroundImage encryption scheme based on 3D baker with dynamical compound chaotic sequence cipher generator
Tong, X., & Cui, M. (2009) · Signal Processing · doi:10.1016/j.sigpro.2008.09.011 · Cited by 196 · cited 1×
“Unfortunately, most of them have been found to be insecure of different extents from the viewpoint of modern cryptography [6, 7, 8, 9, 10, 11, 12, 13, 14].”
Background
Cited by
Sorted by citations
Image encryption using 2D Logistic-adjusted-Sine map
Hua, Z., & Zhou, Y. (2016) · Information Sciences · doi:10.1016/j.ins.2016.01.017 · Cited by 745
“Many successful cryptanalysis cases using the chosen-plaintext or chosen-ciphertext attack were reported in [22,23,30].”
BackgroundA Comprehensive Review on Image Encryption Techniques
Kaur, M., & Kumar, V. (2018) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-018-9298-8 · Cited by 409
A novel image encryption scheme based on DNA sequence operations and chaotic systems
Chai, X., Gan, Z., Yuan, K., Chen, Y., & Liu, X. (2017) · Neural Computing and Applications · doi:10.1007/s00521-017-2993-9 · Cited by 323
Chen, J., Zhu, Z.-L., Zhang, L.-B., Zhang, Y., & Yang, B.-Q. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.07.034 · Cited by 320
“However, as pixel values remain unchanged after image permutation, an adversary can easily launch chosen-plaintext attack to recover the permutation matrix and hence crack the permutation-only ciphers [33-35].”
BackgroundOn the cryptanalysis of Fridrich’s chaotic image encryption scheme
Xie, E. Y., Li, C., Yu, S., & Lü, J. (2017) · Signal Processing · doi:10.1016/j.sigpro.2016.10.002 · Cited by 268
“As quantitatively analyzed in [18, 19], any position permutation-only encryption scheme can be efficiently broken with only O(dlogL(H · W)e) known/chosen plaintexts and the computational complexity of magnitude O(H ·W · dlogL(H · W)e), where L denotes the number of different gray-values of the plaintexts, and H × W (h…”
BackgroundSelf-citationZhou, N., Li, H., Wang, D., Pan, S., & Zhou, Z. (2015) · Optics Communications · doi:10.1016/j.optcom.2014.12.084 · Cited by 269
Brief review on application of nonlinear dynamics in image encryption
Özkaynak, F. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4056-x · Cited by 262
Cryptanalyzing an Image-Scrambling Encryption Algorithm of Pixel Bits
Li, C., Lin, D., & Lü, J. (2017) · IEEE Multimedia · doi:10.1109/mmul.2017.3051512 · Cited by 223
“As the full version of ISEA was cryptanalyzed comprehensively in [9], only the simpler version is studied in the remainder of this paper.”
BackgroundMethodInfluentialSelf-citationOn the Security of Permutation-Only Image Encryption Schemes
Jolfaei, A., Wu, X.-W., & Muthukkumarasamy, V. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2489178 · Cited by 221
“To verify the feasibility of the proposed attack, experiments were performed on the recently proposed permutation-only image ciphers by Rahman et al. [16] and Fu et al. [17].”
BackgroundMethodAn image encryption scheme based on rotation matrix bit-level permutation and block diffusion
Zhang, Y., & Xiao, D. (2013) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2013.06.031 · Cited by 200
Design of image cipher using block-based scrambling and image filtering
Hua, Z., & Zhou, Y. (2017) · Information Sciences · doi:10.1016/j.ins.2017.02.036 · Cited by 199
Medical image encryption using edge maps
Cao, W., Zhou, Y., Chen, C. L. P., & Xia, L. (2016) · Signal Processing · doi:10.1016/j.sigpro.2016.10.003 · Cited by 189
Cryptanalysis of a DNA-based image encryption scheme
Chen, J., Chen, L., & Zhou, Y. (2020) · Information Sciences · doi:10.1016/j.ins.2020.02.024 · Cited by 195
Cracking a hierarchical chaotic image encryption algorithm based on permutation
Li, C. (2016) · Signal Processing · doi:10.1016/j.sigpro.2015.07.008 · Cited by 173
“In [11], the computational complexity of the attack is further reduced to O(n · (M ·N)) by replacing the set intersection operations of quadratic complexity with linear element access operations.”
BackgroundSelf-citationChen, J., Zhang, Y., Qi, L., Fu, C., & Xu, L. (2017) · Optics & Laser Technology · doi:10.1016/j.optlastec.2017.09.008 · Cited by 173
Zhang, Y., Xiao, D., Shu, Y., & Li, J. (2013) · Signal Processing Image Communication · doi:10.1016/j.image.2012.12.009 · Cited by 150
Designing permutation–substitution image encryption networks with Henon map
Ping, P., Xu, F., Mao, Y., & Wang, Z. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.12.048 · Cited by 149
An efficient image encryption scheme using lookup table-based confusion and diffusion
Chen, J., Zhu, Z., Fu, C., Zhang, L., & Zhang, Y. (2015) · Nonlinear Dynamics · doi:10.1007/s11071-015-2057-6 · Cited by 123
“In other words, we can directly construct the permutation matrix ( PM ) [39,40] as Eq.”
BackgroundMethodA novel chaotic map application in image encryption algorithm
Li, L. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124316 · Cited by 133
Breaking a novel colour image encryption algorithm based on chaos
Li, C., Zhang, L. Y., Ou, R., Wong, K., & Shu, S. (2012) · Nonlinear Dynamics · doi:10.1007/s11071-012-0626-5 · Cited by 117
“Referring to quantitative cryptanalysis of permutation-only encryption algorithms in [19, 20], the complexity of breaking the position permutation part is only O(3MN).”
BackgroundSelf-citationA chaotic image encryption scheme owning temp-value feedback
Zhang, L. Y., Hu, X., Liu, Y., Wong, K., & Gan, J. (2014) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2014.03.016 · Cited by 114
“Thus makes this kind of permutation tough for the known/chosen plaintext attack proposed in [13, 17].”
BackgroundA fuzzy based ROI selection for encryption and watermarking in medical image using DWT and SVD
Balasamy, K., & Suganyadevi, S. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09981-5 · Cited by 114
“Apply 2-level DWT on W, W = [LL2,HL2, LH2,HH2] 7.”
MethodInfluentialCryptanalysis of a one round chaos-based Substitution Permutation Network
Arroyo, D., Díaz, J. A., & Rodríguez, F. B. (2012) · Signal Processing · doi:10.1016/j.sigpro.2012.11.019 · Cited by 110
“As it is commented in [21], the fact that Eq.”
BackgroundMethodSecurity measurement of a medical communication scheme based on chaos and DNA coding
Chen, L., Li, C., & Li, C. (2022) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2021.103424 · Cited by 109
“In this process, MPPS is degenerated to a position permutation-only encryption scheme, whose security performance has been studied in depth in [22, 21].”
MethodSelf-citationLuo, Y., Zhou, R., Liu, J., Cao, Y., & Ding, X. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4251-9 · Cited by 112
“Specifically, several chaotic cryptosystems have been proposed for image security [23,30].”
BackgroundA novel bit permutation-based image encryption algorithm
Raza, S. F., & Satpute, V. (2019) · Nonlinear Dynamics · doi:10.1007/s11071-018-4600-8 · Cited by 99
Differential cryptanalysis of a novel image encryption algorithm based on chaos and Line map
Chen, L., Ma, B., Zhao, X., & Wang, S. (2016) · Nonlinear Dynamics · doi:10.1007/s11071-016-3153-y · Cited by 99
“In [20], Li et al. optimize the analysis above by a binary tree clas-sification method and a multi-branch tree classification method, and the corresponding spatial complexity and the computational complexity are reduced to only O ( M N ) and O ( M N log L ( M N )) ,respectively.”
MethodA Content-Adaptive Joint Image Compression and Encryption Scheme
Li, P., & Lo, K. (2017) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2017.2786860 · Cited by 94
Self-citationTPE2: Three-Pixel Exact Thumbnail-Preserving Image Encryption
Zhao, R., Zhang, Y., Xiao, X., Ye, X., & Lan, R. (2021) · Signal Processing · doi:10.1016/j.sigpro.2021.108019 · Cited by 94
Counteracting Dynamical Degradation of Digital Chaotic Chebyshev Map via Perturbation
Liu, Y., Luo, Y., Song, S., Cao, L., Liu, J., & Harkin, J. (2017) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812741750033x · Cited by 88
Zhou, N., Yang, J., Tan, C., Pan, S., & Zhou, Z. (2015) · Optics Communications · doi:10.1016/j.optcom.2015.05.043 · Cited by 87
An efficient image encryption scheme using gray code based permutation approach
Chen, J., Zhu, Z., Fu, C., Yu, H., & Zhang, L. (2014) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2014.11.017 · Cited by 82
Plaintext-related image encryption algorithm based on perceptron-like network
Zhang, Y., Chen, A., Tang, Y., Dang, J., & Wang, G. (2020) · Information Sciences · doi:10.1016/j.ins.2020.03.054 · Cited by 81
Design of an image encryption scheme based on a multiple chaotic map
Tong, X. (2012) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2012.11.002 · Cited by 83
Breaking an Image Encryption Algorithm Based on DNA Encoding and Spatiotemporal Chaos
Wen, H., Yu, S., & Lü, J. (2019) · Entropy · doi:10.3390/e21030246 · Cited by 82
“Whereas, in 2017, Dou et al. [30] used the chosen-plaintext attack method to break the algorithm proposed in Reference [29].”
BackgroundMethodInfluentialCryptanalysis of image encryption scheme based on a new 1D chaotic system
Dhall, S., Pal, S. K., & Sharma, K. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.12.021 · Cited by 77
Zhang, Y., Xiao, D., Wen, W., & Liu, H. (2013) · Optics Letters · doi:10.1364/ol.38.004506 · Cited by 76
Zhang, Y., Wen, W., Su, M., & Li, M. (2013) · Optik · doi:10.1016/j.ijleo.2013.09.018 · Cited by 74
Cryptanalysis of a chaotic image cipher using Latin square-based confusion and diffusion
Hu, G., Xiao, D., Wang, Y., & Li, X. (2017) · Nonlinear Dynamics · doi:10.1007/s11071-016-3311-2 · Cited by 74
“What is more, the optimal quantitative cryptanalysis of permutation-only cipher has been thoroughly and systematically discussed in [20], in which only few known/chosen plain images are sufficient to achieve a good attack performance.”
BackgroundImproved known-plaintext attack to permutation-only multimedia ciphers
Zhang, L. Y., Liu, Y., Wang, C., Zhou, J., Zhang, Y., & Chen, G. (2018) · Information Sciences · doi:10.1016/j.ins.2017.11.021 · Cited by 75
A new image encryption algorithm based on two-dimensional spatiotemporal chaotic system
He, Y., Zhang, Y., & Wang, X. (2018) · Neural Computing and Applications · doi:10.1007/s00521-018-3577-z · Cited by 76
Cryptanalysis and improvement in a chaotic image cipher using two-round permutation and diffusion
Li, M., Lu, D., Xiang, Y., Zhang, Y., & Ren, H. (2019) · Nonlinear Dynamics · doi:10.1007/s11071-019-04771-7 · Cited by 72
“Meanwhile, some encryption meth-ods with only permutation or diffusion have also been cracked [21–24].”
BackgroundCryptanalysis of Image Ciphers With Permutation-Substitution Network and Chaos
Chen, J., Chen, L., & Zhou, Y. (2020) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2020.3021908 · Cited by 69
Hanif, M., Naqvi, R. A., Abbas, S., Khan, M. A., & Iqbal, N. (2020) · IEEE Access · doi:10.1109/access.2020.3004536 · Cited by 69
“In the literature, one can easily find encryption schemes that only perform the permutation (confusion/scrambling) [19]–[22].”
BackgroundZhang, Y., Xiao, D., Wen, W., & Li, M. (2014) · Nonlinear Dynamics · doi:10.1007/s11071-014-1235-2 · Cited by 67
“Moreover, some works [9–13] to evaluate the security of chaos-based image cryptosystems are of vital significance for its advancement.”
BackgroundIqbal, N., Hanif, M., Abbas, S., Khan, M. A., & Rehman, Z. U. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.102809 · Cited by 73
A Chaos Based Image Encryption Scheme Using Digit-Level Permutation and Block Diffusion
Ping, P., Fan, J., Mao, Y., Xu, F., & Gao, J. Z. (2018) · IEEE Access · doi:10.1109/access.2018.2879565 · Cited by 68
“Such pixel-level permutations are vulnerable to histogram attacks and chosen/known-plaintext attacks if they have no diffusions or bad diffusions [25], [26].”
BackgroundCryptanalysis of an image encryption algorithm using Chebyshev generator
Wang, X., Luan, D., & Bao, X.-M. (2013) · Digital Signal Processing · doi:10.1016/j.dsp.2013.10.020 · Cited by 67
Security analysis and enhancements of an image cryptosystem based on hyperchaotic system
Ahmad, M., Doja, M. N., & Beg, M. M. S. (2018) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2018.02.002 · Cited by 68
“…have been successfully cracked by security experts and attackers and were found insecure (Hermassi et al., 2012; Li, 2016; Bechikh et al., 2015; Li and Lo, 2011; Rhouma and Belghith, 2009; Ahmad, 2011; Jeng et al., 2015; Özkaynak et al., 2012; Özkaynak and Özer, 2016; Chen et al., 2017; Fan et…”
Universal Chosen-Ciphertext Attack for a Family of Image Encryption Schemes
Chen, J., Chen, L., & Zhou, Y. (2020) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2020.3011315 · Cited by 67
Parallel strength Pareto evolutionary algorithm‐II based image encryption
Kaur, M., Singh, D., & Uppal, R. S. (2019) · IET Image Processing · doi:10.1049/iet-ipr.2019.0587 · Cited by 65
“From Tables 10 and 12, it can be seen that the proposed approach has minimum horizontal, diagonal, and vertical correlations in most of the cases.”
BackgroundCryptanalyzing Two Image Encryption Algorithms Based on a First-Order Time-Delay System
Liu, S., Li, C., & Hu, Q. (2021) · IEEE Multimedia · doi:10.1109/mmul.2021.3114589 · Cited by 66
“As discussed in [17, 18], some minor error elements in permutation matrix have no much influence on the decryption performance.”
BackgroundMethodSelf-citationCryptanalysis of a DNA and chaos based image encryption algorithm
Dou, Y., Liu, X., Fan, H., & Li, M. (2017) · Optik · doi:10.1016/j.ijleo.2017.08.050 · Cited by 66
SPRING: a novel parallel chaos-based image encryption scheme
Lee, W.-K., Phan, R. C.-W., Yap, W.-S., & Goi, B.-M. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4076-6 · Cited by 65
Chaotic image encryption using pseudo-random masks and pixel mapping
Li, X., Li, C., & Lee, I. (2015) · Signal Processing · doi:10.1016/j.sigpro.2015.11.017 · Cited by 65
Self-citationEfficient Chaos-Based Substitution-Box and Its Application to Image Encryption
El‐Latif, A. A. A., Abd-El-Atty, B., Belazi, A., & Iliyasu, A. M. (2021) · Electronics · doi:10.3390/electronics10121392 · Cited by 68
Khelifi, F. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.09.020 · Cited by 63
“It has also been successful in breaking a number of permutation-only image encryption systems [28, 29] though its performance remains clearly lower than that of the known-plaintext attack and the chosen-plaintext attack [30, 31, 32].”
BackgroundCryptanalysis and improvement in an image encryption scheme using combination of the 1D chaotic map
Chen, J., Han, F., Qian, W., Yao, Y.-D., & Zhu, Z.-L. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4332-9 · Cited by 62
Cryptanalyzing a chaos-based image encryption algorithm using alternate structure
Zhang, L. Y., Li, C., Wong, K., Shu, S., & Chen, G. (2012) · Journal of Systems and Software · doi:10.1016/j.jss.2012.04.002 · Cited by 59
“Keywords: image, chaos, cryptanalysis, differential attack, encryption”
Self-citationFeng, W., & He, Y.-G. (2018) · IEEE Photonics Journal · doi:10.1109/jphot.2018.2880590 · Cited by 60
“An attacker can degrade the encryption algorithm into a permutation-only one by using the chosen plaintext attack, whereas permutation-only algorithms have been proved to be unsafe in many literatures [25]–[27].”
MethodError-free holographic frames encryption with CA pixel-permutation encoding algorithm
Li, X., Xiao, D., & Wang, Q. (2017) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2017.08.018 · Cited by 58
Cryptanalysis of Reversible Data Hiding in Encrypted Images by Block Permutation and Co-Modulation
Qu, L., Chen, F., Shanjun, Z., & He, H. (2021) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2021.3090588 · Cited by 59
Hanif, M., Iqbal, N., Rahman, F. U., Khan, M. A., Ghazal, T. M., Abbas, S., Ahmad, M., Hamadi, H. A., & Yeun, C. Y. (2022) · Sensors · doi:10.3390/s22166243 · Cited by 65
Wen, H., & Yu, S. (2019) · The European Physical Journal Plus · doi:10.1140/epjp/i2019-12797-4 · Cited by 65
Feature Extraction-based Medical Image Watermarking Using Fuzzy-based Median Filter
Balasamy, K., & Shamia, D. (2021) · IETE Journal of Research · doi:10.1080/03772063.2021.1893231 · Cited by 57
Luo, Y., Liu, Y., Liu, J., Tang, S., Harkin, J., & Cao, Y. (2020) · Information Sciences · doi:10.1016/j.ins.2020.12.065 · Cited by 60
Cryptanalysis of a new image encryption algorithm based on chaos
Özkaynak, F., & Özer, A. B. (2016) · Optik · doi:10.1016/j.ijleo.2016.03.018 · Cited by 57
Zhao, L., Adhikari, A., Xiao, D., & Sakurai, K. (2011) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2011.12.015 · Cited by 54
On the security of block scrambling-based ETC systems against jigsaw puzzle solver attacks
Chuman, T., Kurihara, K., & Kiya, H. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952538 · Cited by 56
“Several efficient attacks on the permutation-only encryption have been studied [9,10], but they are not available for the block scrambling-based encryption.”
BackgroundXie, T., Liu, Y., & Tang, J. (2014) · Optik · doi:10.1016/j.ijleo.2014.07.111 · Cited by 52
Breaking a novel image encryption scheme based on Brownian motion and PWLCM chaotic system
Zhu, C., Xu, S., Hu, Y., & Sun, K. (2014) · Nonlinear Dynamics · doi:10.1007/s11071-014-1757-7 · Cited by 52
“In this case, suppose the 3×3 cipher image to be recovered in 1D form is C = [196, 179, 18, 219, 157, 93, 62, 58, 105]; M = 3, N = 3, and L = M × N = 9.”
BackgroundA novel gray scale image encryption scheme based on pixels’ swapping operations
Bashir, Z., Iqbal, N., & Hanif, M. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09695-8 · Cited by 54
“Some encryption schemes were developed by permutation-only [18, 19, 28], for instance.”
MethodA block chaotic image encryption scheme based on self-adaptive modelling
Ye, G., & Zhou, J. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2014.05.025 · Cited by 49
Performance study of selective encryption in comparison to full encryption for still visual images
Khashan, O. A., Zın, A. M., & Sundararajan, E. A. (2014) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/jzus.c1300262 · Cited by 45
“Furthermore, several random position permutation algorithms (Li et al., 2008; Li and Lo, 2011; Zhang et © Zhejiang University and Springer-Verlag Berlin Heidelberg 2014 al., 2013a) and chaotic based cryptosystems (Liu and Wang, 2010; Bhatnagar and Wu, 2012; Zhang et al., 2013b) have been used to…”
MethodJoint SPIHT compression and selective encryption
Xiang, T., Qu, J., & Xiao, D. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2014.03.009 · Cited by 49
An Image Encryption Algorithm Utilizing Julia Sets and Hilbert Curves
Sun, Y., Chen, L., Xu, R., & Kong, R. (2014) · PLoS ONE · doi:10.1371/journal.pone.0084655 · Cited by 47
“For some shortcomings in encryption algorithms, Li et al. made the optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks [13] [14].”
MethodCryptanalysis of an image block encryption algorithm based on chaotic maps
Ma, Y., Li, C., & Ou, B. (2020) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2020.102566 · Cited by 100
Self-citationA Novel Image Encryption Scheme Using the Composite Discrete Chaotic System
Zhu, H., Zhang, X., Yu, H., Zhao, C., & Zhu, Z. (2016) · Entropy · doi:10.3390/e18080276 · Cited by 48
Differential attack on a hyper-chaos-based image cryptosystem with a classic bi-modular architecture
Wen, W., Zhang, Y., Su, M., Zhang, R., Chen, J., & Li, M. (2016) · Nonlinear Dynamics · doi:10.1007/s11071-016-3049-x · Cited by 47
“Once this diffusion algorithm is broken, the algorithm to be cryptanalyzed is equivalent to a permutation-only cipher, which has been thoroughly studied in [18,19].”
BackgroundMethodOn the Security of Block Scrambling-Based EtC Systems against Extended Jigsaw Puzzle Solver Attacks
Chuman, T., Kurihara, K., & Kiya, H. (2017) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2017mup0001 · Cited by 49
“Several efficient attacks on the permutation-only encryption have been studied [11], [12], but they are not available for the block scrambling-based encryption.”
BackgroundSurvey on JPEG compatible joint image compression and encryption algorithms
Li, P., & Lo, K. (2020) · IET Signal Processing · doi:10.1049/iet-spr.2019.0276 · Cited by 47
Self-citationChosen plaintext attack on JPEG image encryption with adaptive key and run consistency
He, H., Yuan, Y., Ye, Y., Tai, H., & Chen, F. (2022) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2022.103733 · Cited by 46
Differential cryptanalysis of a medical image cryptosystem with multiple rounds
Chen, L., & Wang, S. (2015) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2015.07.024 · Cited by 46
“Li et al and Li and Lo [12,13] have demonstrated that the permutation-only schemes are insecure, but their cryptanalysises cannot apply to the permutation–diffusion (permutation–substitution) encryption type [1].”
BackgroundMethodImage encryption based on a new 2D logistic adjusted logistic map
Sharma, M. J. (2019) · Multimedia Tools and Applications · doi:10.1007/s11042-019-08079-x · Cited by 44
Cryptanalysis and Improvement of an Efficient and Secure Medical Image Protection Scheme
Zhang, L., Zhu, Z., Yang, B.-Q., Liu, W., Zhu, H., & Zou, M. (2015) · Mathematical Problems in Engineering · doi:10.1155/2015/913476 · Cited by 41
“After the substitution key stream elements have been recovered, there are various types of methods for the attackers to go back to retrieve the permutationmatrix [24, 31], and then thewhole cryptosystem is completely broken.”
MethodChuman, T., Kurihara, K., & Kiya, H. (2017) · IEEE International Conference on Multimedia and Expo (ICME) · doi:10.1109/icme.2017.8019487 · Cited by 43
“Several efficient attacks on the permutation-only encryption have been studied [9,10], but they are not available for the block scrambling-based encryption.”
BackgroundOutsourcing chaotic selective image encryption to the cloud with steganography
Xiang, T., Hu, J., & Sun, J. (2015) · Digital Signal Processing · doi:10.1016/j.dsp.2015.05.006 · Cited by 42
A chaos-based image encryption scheme using 2D rectangular transform and dependent substitution
Zhang, X., Fan, X. P., Wang, J., & Zhao, Z. (2014) · Multimedia Tools and Applications · doi:10.1007/s11042-014-2372-9 · Cited by 42
“Since the permutation only shuffles the pixel positions but remains the pixel values unchanged, it can be easily cryptanalyzed[14, 15].”
BackgroundAn Enhanced Image Encryption Algorithm Using Fractional Chaotic Systems
Ahmad, M., Shamsi, U., & Khan, I. R. (2015) · Procedia Computer Science · doi:10.1016/j.procs.2015.07.494 · Cited by 40
Azoug, S. E., & Bouguezel, S. (2015) · Optics Communications · doi:10.1016/j.optcom.2015.09.054 · Cited by 41
Cryptanalyzing a class of image encryption schemes based on Chinese remainder theorem
Li, C., Liu, Y., Zhang, L. Y., & Wong, K. (2014) · Signal Processing Image Communication · doi:10.1016/j.image.2014.06.011 · Cited by 39
“So, the complexity required in recovering equivalent version of the permutation part is O(L) [28].”
BackgroundMethodResultSelf-citationLightweight Selective Encryption for Social Data Protection Based on EBCOT Coding
Qiu, H., Qiu, M., Liu, M., & Ming, Z. (2019) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2019.2952553 · Cited by 40
“Since the attacker may recover the permutation rule if the K is not related to the plaintext and is reused [31].”
BackgroundOn The Security of Block Permutation and Co-XOR in Reversible Data Hiding
Qu, L., He, H., & Chen, F. (2021) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2021.3069811 · Cited by 37
On the novel image encryption based on chaotic system and DNA computing
Iqbal, N., Hanif, M., Rehman, Z. U., & Zohaib, M. (2022) · Multimedia Tools and Applications · doi:10.1007/s11042-022-11912-5 · Cited by 37
“In the literature, one may find the ciphers based only on the permutation operations [23, 24, 33].”
BackgroundSecurity analysis of image cryptosystems only or partially based on a chaotic permutation
Hermassi, H., Rhouma, R., & Belghith, S. M. (2012) · Journal of Systems and Software · doi:10.1016/j.jss.2012.04.031 · Cited by 36
“This version of the cryptosystem under study was also analyzed by Li and Lo in [28], their attacks consist on constructing a binary tree to reveal the permutation matrix W of size M × 8N by applying a known plaintext attack and a chosen plaintext attack.”
MethodCryptanalysis of image scrambling based on chaotic sequences and Vigenère cipher
Zhang, Y., Xiao, D., Wen, W., & Nan, H. (2014) · Nonlinear Dynamics · doi:10.1007/s11071-014-1435-9 · Cited by 36
A Pseudorandom Number Generator Based on the Chaotic Map and Quantum Random Walks
Zhao, W., Chang, Z., Ma, C., & Shen, Z. (2023) · Entropy · doi:10.3390/e25010166 · Cited by 39
“; thus, a cryptosystem based on the original chaotic map may be successfully attacked [4,13,14].”
BackgroundSecure image cryptosystem with unique key streams via hyper-chaotic system
Diab, H., & El-semary, A. M. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.06.028 · Cited by 35
Security enhancement of double random phase encoding using rear-mounted phase masking
Chen, J., Zhang, L. Y., Jin-chang, L., & Zhang, L. (2017) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2017.09.019 · Cited by 35
Deciphering an image cipher based on 3-cell chaotic map and biological operations
Zhang, Y., Li, Y., Wen, W., Wu, Y., & Chen, J. (2015) · Nonlinear Dynamics · doi:10.1007/s11071-015-2280-1 · Cited by 35
“If there needs to be a blurry or rough image through the crypt-analysis, the number of the images when deciphering the scrambling phase can be further optimized by the methods [34,35], in which the scrambling-only image ciphers have been thoroughly and systematically cryptanalyzed.”
Method
Metadata
- Authors
- Li, C., & Lo, K.-T.
- Affiliations
- Hong Kong Polytechnic University (HK)
- Corresponding author
- Li, Chengqing
- Venue
- Signal Processing
- Publisher
- Elsevier BV
- Published
- 2011-04
- Volume
- 91
- Issue
- 4
- Pages
- 949-954
- ISSN
- 0165-1684 (ISSN-L)
- OpenAlex
- W4252343056
- Semantic Scholar
- 0de6e37101946ad2f13be6c1af186eaa87525cf3
- Cited by
- 213
- References
- 26
- Citations by year
- 2026: 2 · 2025: 5 · 2024: 12 · 2023: 7 · 2022: 11 · 2021: 16 · 2020: 20 · 2019: 14 · 2018: 21 · 2017: 27 · 2016: 15 · 2015: 20 · 2014: 22 · 2013: 11 · 2012: 8
- FWCI
- 7.72
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- PolyU Institutional Research Archive (Hong Kong Polytechnic University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Keywords
- chaotic maps, cryptanalysis, known-plaintext attack, chosen-plaintext attack, attack complexity, multimedia encryption
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-18, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-18 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
