The DOI matches its Crossref record; 137 of the 137 references it cites were found in a registry or an index; 22 of the 66 sources its claims cite were checked for support.
When an attacker meets a cipher-image in 2018: A year in review
Open accessOverview
AI snapshot
Written from the paper’s full text.
TL;DR
This review surveys representative image encryption schemes and image cryptanalysis works published in 2018, classifying them by essential structure and application scenario. It argues that many chaos-based image ciphers remain vulnerable to chosen-plaintext and related attacks, and that widely used security metrics are inadequate.
Key findings
- The dominant image-encryption structure remains permutation-then-diffusion without substitution-box (PTD-WOS); only a small number of chaotic image encryption schemes use an S-box.
- In 2018, about 30 papers on image cryptanalysis were published; the most striking work is said to depreciate the motivation of most chaos-based encryption schemes and to question metrics such as correlation, entropy, histogram variance, NPCR, UACI, key sensitivity, differential-attack robustness, sequence test, and NIST randomness test.
- Many one-round PTD-WOS schemes are reported vulnerable to chosen-plaintext attack; examples include schemes in [52,37], a plain-image sensitivity mechanism cancelable with probability 1/256 in [117], and recovery of an equivalent secret key using 512 chosen plain-image/cipher-image pairs in [123].
- The paper summarizes challenges including no specific application scenario in most designs, neglect of special image formats, neglect of S-box importance, omitted weak randomness of chaos-based PRNGs, misuse of security test metrics, and designers ignoring previous cryptanalysis lessons.
Methods
- Literature review/survey from the viewpoint of an image cryptanalyst: representative image encryption schemes proposed in 2018 are selected and classified by essential structure, while almost all image cryptanalysis works published in 2018 are surveyed due to their small number.
- Source scope includes a Web of Science Core Collection search for “image” and “cryptograph* or encrypt*” in the Topic field, which found about 1,000 publication records in 2018, plus some top conferences on nonlinear sciences and signal processing such as ISCAS and ICME.
- Analysis is qualitative: encryption schemes are grouped into chaos-based, DNA-encoding, transform-domain, encrypted-domain signal processing, and other application scenarios; cryptanalysis works are grouped into single-round PTD-WOS, complex-structure schemes, and other attacks.
Limitations
- The paper does not state a formal limitations section; it notes that almost all image cryptanalysis works published in 2018 are surveyed because of their small number, but encryption schemes are selected as “most representative” rather than exhaustively.
- Evident from the text: this is a narrative review without a reported systematic search protocol, explicit inclusion/exclusion criteria, or quantitative synthesis.
- Evident from the text: conclusions about security metrics and scheme vulnerabilities rely on cited works; no new experiments or independent benchmarks are presented.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
21 No full text of the sources · 12 Own interpretation · 11 Partly supported · 3 Supported so far · 3 No basis given · 2 Supported · 2 Not checked yet · 1 Not supported · accuracy not yet measured
At least one cited source doesn’t support this claim or points to a different paper, and none confirmed it — see the verdicts below.
In the paper
“However, the incurred computational load is not considered for the required security level.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.1. Cryptanalysis of single round PTDWOS
What the sources say
- Disputedcites [32] Ahmad, 2018, Cryptanalysis of an image encryption algorithm based on combined chaos for a BAN system, and improved scheme using SHA-512 and hyperchaos, Symmetry-Basel sourceExperimental — accuracy not yet measured
Section 6.6, “Computation Efficiency” (page unavailable), explicitly considers computational resources alongside security performance. It says one encryption round is sufficient for strong performance and concludes that the improved scheme has good computational efficiency, contrary to the claim that computational load was not considered. (LLM, conf=0.80)
Checked by a reasoning model — may be wrong.
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.
- Disputed
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“As the sensitivity mechanism on the plain-image is built via a modulo addition, it can be canceled with a non-negligible probability of 1/256.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.1. Cryptanalysis of single round PTDWOS
What the sources say
- Partly supportedcites [117] Li, 2018, Cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography, IEEE Multimed sourceExperimental — accuracy not yet measured
Section 3.1 (p. 3) says the plain-image sensitivity mechanism is cancelled because of modulo addition and gives a probability of 1/256. It specifies that this probability applies if every pixel in the plain-images is uniformly distributed; the citing sentence omits that condition. (LLM, conf=0.87)
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.
- Partly supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Meanwhile, no permutation operation is adopted in the scheme, causing an equivalent secret key can be derived from one pair of a known plain-image and its corresponding cipher-image.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.1. Cryptanalysis of single round PTDWOS
What the sources say
- Partly supportedcites [117] Li, 2018, Cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography, IEEE Multimed sourceExperimental — accuracy not yet measured
Section 3.1 (pp. 3–4) says one known plain-image and its corresponding cipher-image can yield a mask image that acts as an equivalent secret key. Its use to decrypt another image is conditional on the same secret key and public parameter and a matching plain-image-derived value. Our copy does not attribute the vulnerability to the absence of a permutation operation; Section 3.1 instead discusses a cancelled sensitivity mechanism. (LLM, conf=0.85)
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.
- Partly supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Similar to the strategy introduced in [2], the permutation relation of a multiple-round PTDWOS is recovered by checking how the changes of the cipher-pixels influence that of the plain-pixels in the scenario of chosenciphertext attack [126].”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.2. Cryptanalysis of some image encryption schemes with complex structure
What the sources say
- Partly supportedcites [2] Xie, 2017, On the cryptanalysis of Fridrich’s chaotic image encryption scheme, Signal Process sourceExperimental — accuracy not yet measured
Section 3.2 (p. 4) describes a chosen-ciphertext method that uses the influence relation between cipher-pixels and plain-pixels to estimate the permutation. But the paper tests and critiques that method: Section 3.2 (pp. 4–5) reports keys for which it gives a wrong result or fails, so the unqualified claim that the permutation relation is recovered overstates the source. (LLM, conf=0.88)
- Not checked — no full text of the sourcecites [126] Hoang, 2018, Cryptanalysis and security improvement for a symmetric color image encryption algorithm, Optik source
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: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“The equivalent secret key of such diffusion mechanism can be easily recovered [120].”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.1. Cryptanalysis of single round PTDWOS
What the sources say
- Supportedcites [120] Zhang, 2018, On the security of a class of diffusion mechanisms for image encryption, IEEE Trans Cybern source
The Conclusion (page not available) reports that the equivalent key streams in the three image ciphers studied can be retrieved using a small number of plaintext images. It also says the diffusion equations analyzed, including the one combining modulo addition and XOR, can be solved with O(1) known plaintexts. (LLM, conf=0.93)
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.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“For example, the sensitivity mechanisms of PRNS on the plain-image built in [80,119,27,92] can be easily canceled by constructing some special plain-images, which has been reported in many cryptanalysis papers such as [1,117].”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
What the sources say
- Not checked — no full text of the sourcecites [80] Slimane, 2018, A novel chaotic image cryptosystem based on DNA sequence operations and single neuron model, Multimed Tools Appl source
- Partly supportedcites [119] Zhu, 2018, Cryptanalyzing and improving a novel color image encryption algorithm using RT-enhanced chaotic tent maps, IEEE Access sourceExperimental — accuracy not yet measured
Section III and ‘A. Recover the Encryption Key Streams’ show that specially chosen plaintext images, including an all-zero image, let the authors recover key streams in the algorithm they attack. But ‘C. Recover the Target Plain Image’ says those streams are unrelated to the plaintext, so this is not an example of canceling a plain-image-dependent PRNS sensitivity mechanism. Section G says the paper’s improved, plaintext-dependent streams cannot be reused to decrypt a different image. (LLM, conf=0.84)
- Not checked — no full text of the sourcecites [27] Kumar, 2018, A cryptographic model for better information security, J Inf Secur Appl source
- Not checked — no full text of the sourcecites [92] He, 2018, JPEG image encryption with improved format compatibility and file size preservation, IEEE Trans Multimedia source
- Partly supportedcites [1] Li, 2018, Cryptanalysis of a chaotic image encryption algorithm based on information entropy, IEEE Access sourceExperimental — accuracy not yet measured
In “B. Differential Cryptanalysis” (p. 8), the paper says it is very easy to construct plain-images that produce the same keystream in IEAIE, defeating that scheme’s plain-image-dependent mechanism. The cited paper examines IEAIE, identified as [27] in its Introduction (p. 2); our copy does not establish the same result for the other three schemes named in the citing sentence. (LLM, conf=0.86)
- Partly supportedcites [117] Li, 2018, Cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography, IEEE Multimed sourceExperimental — accuracy not yet measured
Section 3.1 (p. 3) says the plain-image sensitivity mechanism in IEAE is canceled by modulo addition, and p. 4 describes an attack when two plain-images generate the same value. The paper does not establish that specially constructed plain-images easily cancel plain-image-dependent PRNS mechanisms across the other cited schemes. (LLM, conf=0.84)
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: passes — The paper gives a reason why it holds.
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“In [6], two chosen plain-images are constructed to recover an equivalent version of S-box and PRNS of a chaos-based image encryption scheme using Sbox.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.2. Cryptanalysis of some image encryption schemes with complex structure
What the sources say
- Partly supportedcites [6] Zhu, 2018, Cryptanalysis and improvement on an image encryption algorithm design using a novel chaos based S-box, Symmetry-Basel sourceExperimental — accuracy not yet measured
Section 3.1 constructs two chosen plaintext images, and Step 4 constructs an array equivalent to the S-box. The paper’s Additional information section says the attack can decipher the ciphertext without knowing the secret keystream Y itself; it does not describe recovering an equivalent version of that stream (the claim’s PRNS). (LLM, conf=0.86)
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: passes — The paper gives a reason why it holds.
- Partly supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The underlying weak randomness of chaos-based PRNG is widely omitted.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
What the sources say
- Partly supportedcites [48] Li, 2019, Dynamic analysis of digital chaotic maps via state-mapping networks, IEEE Trans Circuits Syst I sourceExperimental — accuracy not yet measured
The Introduction (p. 2) says finite-precision chaotic maps cannot reach an ideal chaotic state and that degraded dynamics may weaken encryption schemes. This supports concern about chaos-based PRNGs, but the paper does not say that image-encryption schemes widely omit or overlook weak randomness. (LLM, conf=0.82)
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.
- Partly supported
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“In 2018, improvement (enhancement, remedy) methods were proposed to fix the reported security defects in a number of papers on image cryptanalysis as references [6,13,14,15,16,17,18,19,20,30,32,119,131].”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
What the sources say
- Supportedcites [6] Zhu, 2018, Cryptanalysis and improvement on an image encryption algorithm design using a novel chaos based S-box, Symmetry-Basel source
The Abstract reports security flaws in an image-encryption algorithm and proposes an improved scheme. Section 4, “The Improved Image Encryption Scheme,” says the authors redesigned the scheme to overcome those flaws. This 2018 paper therefore supports its use as one example among the cited papers; it need not establish the claim for every other reference. (LLM, conf=0.93)
- Not checked — no full text of the sourcecites [13] Diab, 2018, Cryptanalysis and improvement of the image cryptosystem reusing permutation matrix dynamically, Signal Process source
- Not checked — no full text of the sourcecites [14] Wu, 2018, Cryptanalysis and enhancements of image encryption based on three-dimensional bit matrix permutation, Signal Process source
- Not checked — no full text of the sourcecites [15] Li, 2018, Cryptanalysis and improvement of a chaotic image encryption by first-order time-delay system, IEEE Multimed. source
- Not checked — no full text of the sourcecites [16] Wang, 2018, Cryptanalysis and enhancements of image encryption using combination of the 1D chaotic map, Signal Process source
- Not checked — no full text of the sourcecites [17] Panwar, 2018, Cryptanalysis and improvement of an image encryption scheme using combination of one-dimensional chaotic maps, J Electron Imaging source
- Not checked — no full text of the sourcecites [18] Chen, 2018, Cryptanalysis and improvement in an image encryption scheme using combination of the 1D chaotic map, Nonlinear Dyn source
- Supportedcites [19] Zhu, 2018, Improved cryptanalysis and enhancements of an image encryption scheme using combined 1D chaotic maps, Entropy source
The Conclusions (Section 6) state that the authors identified defects in an image cryptosystem and proposed an improved encryption scheme to address them. This paper supports the citing sentence as one example among the several cited papers; it does not need to document the other papers' remedies. (LLM, conf=0.91)
- Supportedcites [20] Feng, 2018, Cryptanalysis and improvement of the hyper-chaotic image encryption scheme based on DNA encoding and scrambling, IEEE Photonics J source
Section 5 identifies security weaknesses in the image-encryption scheme and proposes improvements. Section 5.3 gives specific remedies, including strengthening diffusion. This paper therefore supports its use as one example among the cited papers proposing ways to address reported security defects; it does not establish that the remedies were implemented or proved effective. (LLM, conf=0.91)
- Not checked — no full text of the sourcecites [30] Diab, 2018, Secure image cryptosystem with unique key streams via hyper-chaotic system, Signal Process source
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.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“As shown in [116,117], the security assessment metrics used in most chaos-based image encryption schemes are unconvincing.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
What the sources say
- Not checked — no full text of the sourcecites [116] Preishuber, 2018, Depreciating motivation and empirical security analysis of chaos-based image and video encryption, IEEE Trans Inf Forensics Secur source
- Partly supportedcites [117] Li, 2018, Cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography, IEEE Multimed sourceExperimental — accuracy not yet measured
Section 3.2 (pp. 5–7) questions several security-assessment metrics used for IEAE, including the Lyapunov exponent, UACI, histograms, and pixel-correlation coefficients. It says IEAE’s security defects also occur in many other image-encryption schemes (p. 4), but does not establish that the metrics used in most chaos-based schemes are unconvincing. (LLM, conf=0.85)
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.
- Probably not a substantial claim. 16
- It may state two separate claims as one. 9
- The quote only partly states this claim. 1
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Considering the quantitative test results of the four special schemes on the metrics, it is concluded that the metrics are far ineffective for security analysis”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3. Survey on image cryptanalysis in 2018
What the sources say
- Not checked — no full text of the sourcecites [116] Preishuber, 2018, Depreciating motivation and empirical security analysis of chaos-based image and video encryption, IEEE Trans Inf Forensics Secur source
- Partly supportedcites [1] Li, 2018, Cryptanalysis of a chaotic image encryption algorithm based on information entropy, IEEE Access sourceExperimental — accuracy not yet measured
The Conclusion (p. 8) says every security metric used to assess IEAIE is incapable of testifying to its real security performance. That supports the criticism of those metrics, but not the broader claim that security-assessment metrics used throughout chaotic cryptography are ineffective. (LLM, conf=0.85)
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.
Probably not a substantial claim.
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“Based on the preliminary cryptanalysis works given in [16] and [18], both the equivalent secret-key of Pak's scheme and all its unknown parameters are recovered by a little more pairs of chosen plain-image and the corresponding cipher-image in [19].”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.1. Cryptanalysis of single round PTDWOS
What the sources say
- Not checked — no full text of the sourcecites [16] Wang, 2018, Cryptanalysis and enhancements of image encryption using combination of the 1D chaotic map, Signal Process source
- Not checked — no full text of the sourcecites [18] Chen, 2018, Cryptanalysis and improvement in an image encryption scheme using combination of the 1D chaotic map, Nonlinear Dyn source
- Supportedcites [19] Zhu, 2018, Improved cryptanalysis and enhancements of an image encryption scheme using combined 1D chaotic maps, Entropy source
The Introduction says the earlier analyses could not crack all of Pak’s unknown parameters, while this paper’s improved cryptanalysis can decipher both the equivalent secret keys and all unknown parameters. Section 3 describes recovering them using selected plaintext images and their corresponding ciphertext images, including additional pairs for the permutation array (page numbers unavailable). (LLM, conf=0.92)
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.
Every source the paper cites for this claim was checked and supports it.
In the paper
“But, the correlation among blocks in cipher-images may still facilitate optimizing the attacking on the block-wise permutation schemes analyzed in [114,115] with the advanced jigsaw puzzle solvers.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 2.5. Generating cipher-images in other application scenarios
What the sources say
- Supportedcites [114] Imaizumi, 2018, A block-permutation-based encryption scheme with independent processing of RGB components, IEICE Trans Inf Syst source
Section 2.2 says jigsaw puzzle solvers use correlations among pieces and should be considered an attack on block-permutation-based encryption. The Introduction says encrypted images retain some pixel correlation, while Section 4.1.2 reports that a solver correctly assembled regions of conventionally encrypted images. The paper also finds its proposed scheme more resistant; the claim's qualified 'may' is consistent with that distinction. Page numbers are not provided in our copy. (LLM, conf=0.92)
- Supportedcites [115] Li, 2016, Cracking a hierarchical chaotic image encryption algorithm based on permutation, Signal Process source
Section 3.1 (p. 3) says that correlations between neighboring blocks persist in HCIE and may help an attacker infer blocks’ relative locations in a cipher-image by comparing their histograms. It cites a jigsaw-puzzle-solving work for that approach (reference [22], p. 8), supporting the citing sentence’s proposed use of puzzle solvers. (LLM, conf=0.86)
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Such encryption-then-compression framework does not seriously influence the further compression and can withstand the attacks based on conventional jigsaw puzzle solvers [113].”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 2.5. Generating cipher-images in other application scenarios
What the sources say
- Partly supportedcites [113] Chuman, 2018, Security evaluation for block scrambling-based image encryption including JPEG distortion against jigsaw puzzle solver attacks, IEICE Trans Fund ElectronCommun Comput Sci sourceExperimental — accuracy not yet measured
The Conclusion (p. 4) reports strong robustness against jigsaw-puzzle-solver attacks for encrypted images including JPEG distortion. But the Introduction (p. 1) says some solvers can partly assemble encrypted images, and the paper does not establish that encryption has little effect on subsequent compression. The attack-resistance finding is therefore narrower than the citing sentence suggests. (LLM, conf=0.86)
plain- 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.
It may state two separate claims as one.
- Partly supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Interestingly, [94] adopts PWLCM as the source producing pseudo-random number sequence, whose randomness is seriously comprised in a digital computer [48].”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 2.4. Signal processing in the encrypted domain
What the sources say
- Not checked — no full text of the sourcecites [94] Puteaux, 2018, An efficient MSB prediction-based method for high-capacity reversible data hiding in encrypted images, IEEE Trans Inf Forensics Secur source
- Partly supportedcites [48] Li, 2019, Dynamic analysis of digital chaotic maps via state-mapping networks, IEEE Trans Circuits Syst I sourceExperimental — accuracy not yet measured
The Introduction (p. 2) says the paper studies the Logistic and Tent maps as examples and discusses using state-mapping networks to evaluate chaos-based pseudorandom generators. It does not say that the authors adopt PWLCM specifically as a source of pseudorandom number sequences. The statement about compromised randomness is attached to [48] in the citing sentence, not to this source. (LLM, conf=0.78)
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: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The periods of PRNS obtained by iterating Logistic map and skew tent map in digital computer are rigorously analyzed in [48].”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
What the sources say
- Partly supportedcites [48] Li, 2019, Dynamic analysis of digital chaotic maps via state-mapping networks, IEEE Trans Circuits Syst I sourceExperimental — accuracy not yet measured
The Introduction (p. 1) says finite-state chaotic-map orbits eventually enter periodic loops, and Section II (p. 2) analyzes the Logistic and Tent maps in digital arithmetic. But the cited paper studies their state-mapping networks rather than rigorously deriving the periods of pseudorandom sequences from both maps; its Tent-map analysis (p. 6) concerns the ordinary Tent map, not a skew tent map. (LLM, conf=0.84)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Partly supported
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
“Almost all image cryptanalysis works published in 2018 are surveyed due to their small number.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > Abstract
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: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
- Rests on an assumption: The selected works are representative of the image encryption and cryptanalysis works proposed in 2018.
In the paper
“In [125], the usability of a 4round diffusion-then-permutation without substitution-box is questioned, which can be considered as a special form of 5-round PTDWOS.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.2. Cryptanalysis of some image encryption schemes with complex structure
What the sources say
- Not checked — no full text of the sourcecites [125] Dhall, 2018, Cryptanalysis of image encryption scheme based on a new 1D chaotic system, Signal Process source
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.
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
“In the year 2018, about 30 papers on image cryptanalysis were published.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3. Survey on image cryptanalysis in 2018
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“Furthermore, the linear relationship between plain-image and the corresponding cipher-image is derived as the adopted permutation is a static rotation of 90 degrees, which is used to support the proposed differential attack.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.2. Cryptanalysis of some image encryption schemes with complex structure
What the sources say
- Not checked — no full text of the sourcecites [125] Dhall, 2018, Cryptanalysis of image encryption scheme based on a new 1D chaotic system, Signal Process 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.
In the paper
“Only the four most significant bits of compressed samples are encrypted, which may cause some and even all visual information of the encrypted object revealed.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 2.1.5. Encrypting images with compressing techniques
What the sources say
- Not checked — no full text of the sourcecites [76] Pudi, 2018, Secure and lightweight compressive sensing using stream cipher, IEEE Trans Circ SystII source
hedgedconditional- 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.
It may state two separate claims as one.
In the paper
“Among some reversible and irreversible gates, including XOR, Toffoli and Fredkin gates, only Fredkin gate can help the supported encryption scheme to withstand chosen-ciphertext attack.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.3. Other image cryptanalysis
What the sources say
- Not checked — no full text of the sourcecites [131] Annaby, 2018, On security of image ciphers based on logic circuits and chaotic permutations, Multimed Tools Appl source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“In [133], Lin et al. further derive coefficients of the nominal matrix of a stream cipher based on 8-D self-synchronous chaotic system in the scenarios of known-plaintext attack and chosen-ciphertext attack, respectively.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.3. Other image cryptanalysis
What the sources say
- Not checked — no full text of the sourcecites [133] Lin, 2018, Cryptanalysis of a chaotic stream cipher and its improved scheme, Int J Bifur Chaos source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Using the strong correlation among neighboring bits in every bit-plane in a natural image, a cipher-text only attack is proposed in [34] to recover the approximate version of the original plain-image with good visual quality.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.3. Other image cryptanalysis
What the sources say
- Not checked — no full text of the sourcecites [34] Khelifi, 2018, On the security of a stream cipher in reversible data hiding schemes operating in the encrypted domain, Signal Process source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Among them, the most striking work is depreciating motivation of most chaos-based encryption schemes in [116], refuting any superiority of chaos-based encryption schemes than several variants of AES in terms of computational effort and security performance”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3. Survey on image cryptanalysis in 2018
What the sources say
- Not checked — no full text of the sourcecites [116] Preishuber, 2018, Depreciating motivation and empirical security analysis of chaos-based image and video encryption, IEEE Trans Inf Forensics Secur source
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.
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
“Once the basic encryption operations are repeated some rounds or S-box is used, the structure of the whole encryption scheme become much more complex, which dramatically increases the hardship of the corresponding cryptanalysis.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.2. Cryptanalysis of some image encryption schemes with complex structure
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no 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
“Actually, deep learning can also be used to test security of an encryption scheme via adversarial training.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 3.3. Other image cryptanalysis
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“As emphasized in the abstract of the special report on PRNG test suite of NIST,”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
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.
Probably not a substantial claim.
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 dependence of PRNS on the plain-image can be canceled with a non-negligible probability due to the commutative principle of summation and quantization error of calculating function in a finite-precision computer.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 2.1.2. Design of single round PTDWOS
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: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A claim is checked only against the cited paper’s full text, never its abstract, and none is available for its sources.
In the paper
“As only one round of the two basic operations are used, the encryption schemes designed in [52,37] are both vulnerable to chosen-plaintext attack.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 2.1.2. Design of single round PTDWOS
What the sources say
- Not checked — no full text of the sourcecites [52] Liu, 2018, A new simple chaotic system and its application in medical image encryption, Multimed Tools Appl source
- Not checked — no full text of the sourcecites [37] Muhammad, 2018, Secure surveillance framework for IoT systems using probabilistic image encryption, IEEE Trans Ind Inf 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.
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
“As a lookup table, S-box is an efficient way to obscure the relationship between the secret key and the cipherimage.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
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
“Prejudice on the value of cryptanalysis obstructs the progress of image security.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check 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. It may be too vague to check against evidence.
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
“Strangely enough, it is seldom adopted in image encryption schemes.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“-The authors proposing a successful attack, e.g.chosen-plaintext attack in [30], on a given image encryption scheme may not own comprehensive knowledge on designing secure image encryption schemes.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
What the sources say
- Not checked — no full text of the sourcecites [30] Diab, 2018, Secure image cryptosystem with unique key streams via hyper-chaotic system, Signal Process source
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it.
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
“which makes essential improvement on the security level of the analyzed schemes very hard.”
§ When an attacker meets a cipher-image in 2018: A Year in Review > 4. The challenges on design and analysis of image encryption schemes
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: unclear — It is unclear whether it could 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 quote only partly states this claim.
The paper relies on this without support.
The selected works are representative of the image encryption and cryptanalysis works proposed in 2018.
“The most representative works among them are selected and classified according to their essential structures.”
The paper relies on this without support.
Classifying the surveyed works according to their essential structures is a valid way to organize and compare them.
“The most representative works among them are selected and classified according to their essential structures.”
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Self-check results appear here once an independent check has confirmed them.
Cited works that were retracted
Works this paper cites that were later retracted, from the retraction notices publishers deposit. Major when the notice came out before this paper was published.
A note, not an issue: for example, a cited work that was retracted only after this paper was published, which its authors could not have known.
In the paper
“The development of quantum cryptography and quantum chaos attracts image presentation in quantum world and study on how to utilize quantum properties for protecting image data [106, 107].”
Cited work 10.1371/journal.pone.0206460 · retracted 2025-12-17 · notice 10.1371/journal.pone.0338963 · this paper published 2019-10
A note, not an issue: for example, a cited work that was retracted only after this paper was published, which its authors could not have known.
In the paper
“There are some papers focusing on designing S-box with chaotic maps [9, 10, 11, 12].”
Cited work 10.1007/s00521-016-2511-5 · retracted 2024-07-22 · notice 10.1007/s00521-024-10125-1 · this paper published 2019-10
Citations
Cites
2 retracted
Khan, M., & Asghar, Z. (2016) · Neural Computing and Applications · doi:10.1007/s00521-016-2511-5 · Cited by 185 · cited 1×
“There are some papers focusing on designing S-box with chaotic maps [9, 10, 11, 12].”
BackgroundRetractedA novel image encryption scheme based on quantum dynamical spinning and rotations
Khan, M., & Waseem, H. M. (2018) · PLoS ONE · doi:10.1371/journal.pone.0206460 · Cited by 74 · cited 1×
“The development of quantum cryptography and quantum chaos attracts image presentation in quantum world and study on how to utilize quantum properties for protecting image data [106, 107].”
BackgroundRetractedSOME 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×
“– Many image encryption schemes are not designed and presented following the basic rules and general guidelines given in [35, 132], which makes essential improvement on the security level of the analyzed schemes very hard.”
Background2D Logistic-Sine-coupling map for image encryption
Hua, Z., Jin, F., Xu, B., & Huang, H. (2018) · Signal Processing · doi:10.1016/j.sigpro.2018.03.010 · Cited by 601 · cited 1×
“[38], Hua et al. design a sine-transform-based chaotic system (STBCS) of generating one-dimensional (1-D) chaotic maps by performing a sine transform to the combination of the outputs of two maps. In [42], Hua et al. design a two-dimensional (2-D) Logistic-Sine-couplingmap (LSCM) and use it as a source of PRNS control…”
MethodImage encryption using 2D Hénon-Sine map and DNA approach
Wu, J., Liao, X., & Yang, B. (2018) · Signal Processing · doi:10.1016/j.sigpro.2018.06.008 · Cited by 430 · cited 1×
“In [82], 2-D Hénon-Sine map (2D-HSM) is constructed as a PRNG to control the involved DNA rules, DNA operation and the position permutation.”
MethodPuteaux, P., & Puech, W. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2799381 · Cited by 396 · cited 1×
“In contrast to many data hiding schemes focusing on LSB, an efficient MSB predictionbased method for RDH-EI is proposed in [94], where reserving embedding room before encryption and vacating embedding room after encryption are discussed, respectively.”
MethodA novel bit-level image encryption algorithm based on 2D-LICM hyperchaotic map
Cao, C., Sun, K., & Liu, W. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.08.020 · Cited by 386 · cited 1×
“In [61], a bit-level image encryption algorithm is designed by operating multiple rounds of bitwise shift operation and XOR in two directions, where a hyperchaotic map is constructed as the source of PRNG by cascading sine map and Logistic map.”
MethodLakshmanan, S., Mani, P., Lim, C. P., Rakkiyappan, R., Balasubramaniam, P., & Nahavandi, S. (2016) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2619345 · Cited by 351 · cited 1×
“nearchaoticmap)[25,26], and coupled map lattice [27]. Rigorously, only the encryptionschemesusingspecialchaosmethodologiescanbe classified as chaos-based encryption schemes, e.g. chaos synchronization [28, 29]. As the opposite of image cryptography,someimpressiveimagecryptanalysisworkswere developed in 2018 [30, 31, 32…”
BackgroundMedical image encryption using high-speed scrambling and pixel adaptive diffusion
Hua, Z., Yi, S., & Zhou, Y. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.10.004 · Cited by 350
Secure Surveillance Framework for IoT Systems Using Probabilistic Image Encryption
Muhammad, K., Hamza, R., Ahmad, J., Lloret, J., Wang, H., & Baik, S. W. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2791944 · Cited by 299 · cited 4×
“As only one round of the two basic operations are used, the encryption scheme designed in [51, 37] are both vulnerable to chosen-plaintext attack.”
BackgroundMethodInfluential
Research works printed but not linked: 1
- Puteaux, 2018, An efficient MSB prediction-based method for high-capacity reversible data hiding in encrypted images, IEEE Trans Inf Forensics Secur, 13, 1670, 10.1109/TIFS.2018.2799381 · DOI · Paper page
Cited by
Sorted by citations
Items 201–214 of 214
Vinayak, A., Swain, S. R., & Maity, S. (2020) · Smart innovation, systems and technologies · doi:10.1007/978-981-15-6202-0_64
Concurrent encryption and lossless compression using inversion ranks
Koc, B., Arnavut, Z., & Koçak, H. (2023) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2023.103587
Tiwari, D. A., & Mondal, B. (2024) · Qeios · doi:10.32388/60nk7h
Tiwari, D. A., & Mondal, B. (2024) · Qeios · doi:10.32388/60nk7h.2
An Improved High-Dimensional Logistic Chaotic System and Its Performance
Zhang, Y., Zhang, X., & Cheng, Y. (2023) · doi:10.1145/3641584.3641712
Self-citationCryptanalysis of a chaotic cipher with key position related to ciphertextPreprint
Zhou, R., & Yu, S. (2024) · Research Square · doi:10.21203/rs.3.rs-4614677/v1
Numerical Simulation of the Thermal Performance of a Building Using Electrochromic Devices
Netto, M. S., Porto, J. D. S., Brum, R. D. S., de Quadros, R. S., & Avellaneda, C. O. (2024) · Defect and diffusion forum/Diffusion and defect data, solid state data. Part A, Defect and diffusion forum · doi:10.4028/p-w0japk
“To meet this growing demand, it is crucial to gradually add and replace fossil fuels with renewable energy sources [4].”
Some Aspects Regarding RSA Cryptosystem
Flaut, C., Flaut, D., & Hošková-Mayerová, Š. (2025) · Studies in systems, decision and control · doi:10.1007/978-3-031-43506-5_35
Breaking a New Image Cryptosystem From Three Perspectives
Zhou, R., & Yu, S. (2025) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2025.3589800
“As chaos-based image ciphers gain prominence in the big data era, security concerns intensify [20], [21].”
Advancements and Challenges in Mobile Payment Security: An Investigation of Vulnerabilities and Gaps
Al-Najjar, H. M., Al‐Rousan, N., & Al-Najjar, D. (2025) · Advances in Science, Technology & Innovation/Advances in science, technology & innovation · doi:10.1007/978-3-031-84889-6_32
Image Watermarking Encryption Algorithm for IoT Utilizing Chaotic Neural Network
Zhu, Y., Ding, D., Wang, Y., et al. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-2581-2_36
Accelerated Security Model-Driven Encryption with Remote Control for Satellite Imagery
Tbahriti, S.-E. (2025) · International Conference on Control, Decision and Information Technologies (CoDIT) · doi:10.1109/codit66093.2025.11321628
“A higher entropy value indicates increased unpredictability, making it more challenging for an adversary to infer the underlying data [10] [11].”
50123 Image Steganography and Attacks Analysis for Secured Data Communication
Manimegalai, R., Kavisri, S., Varshini, S. L. P., et al. (2026) · De Gruyter eBooks · doi:10.1515/9783112214374-023
Nonlinear dynamics, applications to chaos-based encryption
Qiao, Z. (2021) · theses.fr (ABES) · doi:10.70675/c92d6571z9b7ez4705z8113zec7349c812a0 · Cited by 2
Metadata
- Authors
- Li, C., Zhang, Y., & Xie, E. Y.
- Affiliations
- Hunan University (CN)
- Xiangtan University (CN)
- Corresponding author
- Li, Chengqing
- Venue
- Journal of Information Security and Applications
- Publisher
- Elsevier BV
- Published
- 2019-10
- Volume
- 48
- Pages
- 102361
- ISSN
- 2214-2126 (ISSN-L)
- OpenAlex
- W2923415235
- Cited by
- 217
- References
- 137
- Citations by year
- 2026: 4 · 2025: 12 · 2024: 18 · 2023: 20 · 2022: 19 · 2021: 58 · 2020: 66 · 2019: 20
- FWCI
- 18.24
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Journal of Information Security and Applications (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Natural Science Foundation of China
- 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
- image encryption, cryptanalysis attacks, image security
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-23, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-23 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
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
