Cited by 217Chaos-based Image/Signal EncryptionCryptographic Implementations and SecurityComputer Science and Engineering

When an attacker meets a cipher-image in 2018: A year in review

Open access
Li, Chengqing, Zhang, Yun, Xie, Eric Yong·2019·Journal of Information Security and Applications

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

Crossref · 10.1016/j.jisa.2019.102361

Cites

137 of 137 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

22 of 66 cited sources checked · 8 supported · 1 flagged · accuracy not yet measured

  • Interpretationcitation

    The additional operations adopted in [32] to withstand the proposed attack incur computational load that is not considered for the required security level.

    “However, the incurred computational load is not considered for the required security level.”
    Quote in the paperSubstantial claim1 of 1 sources checked
    • cites [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 source

      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.

      Experimental — accuracy not yet measured
  • Findingreasoning

    In [117], the plain-image sensitivity mechanism of a block-wise image encryption scheme using an ECG signal can be canceled with probability 1/256 because it is built via modulo addition.

    “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.”
    Quote in the paperSubstantial claim1 of 1 sources checked
    • cites [117] Li, 2018, Cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography, IEEE Multimed source

      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)

      Experimental — accuracy not yet measured
  • Findingreasoning

    In [117], an equivalent secret key can be derived from one known plain-image and its corresponding cipher-image because no permutation operation is adopted.

    “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.”
    Quote in the paperSubstantial claim1 of 1 sources checked
    • cites [117] Li, 2018, Cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography, IEEE Multimed source

      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)

      Experimental — accuracy not yet measured
  • Findingcitation

    In [126], the permutation relation of a multiple-round PTDWOS is recovered by checking how changes of cipher-pixels influence plain-pixels in a chosen-ciphertext attack.

    “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].”
    Quote in the paperNot a substantial claim1 of 2 sources checked
    • cites [2] Xie, 2017, On the cryptanalysis of Fridrich’s chaotic image encryption scheme, Signal Process source

      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)

      Experimental — accuracy not yet measured
    • cites [126] Hoang, 2018, Cryptanalysis and security improvement for a symmetric color image encryption algorithm, Optik source
  • Interpretationcitation

    The equivalent secret key of a diffusion mechanism using modulo addition and XOR can be easily recovered.

    “The equivalent secret key of such diffusion mechanism can be easily recovered [120].”
    Quote in the paperSubstantial claim1 of 1 sources checked
    • cites [120] Zhang, 2018, On the security of a class of diffusion mechanisms for image encryption, IEEE Trans Cybern source
  • Classified as probably not a substantial claim. 16
  • May combine two claims. 9
  • The quote only partly states this claim. 1
  • Classified as probably not a substantial claim.

    Interpretationcitation

    The security assessment metrics used in chaotic cryptography are far ineffective for security analysis.

    “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”
    Quote in the paperSubstantial claim1 of 2 sources checked
    • cites [116] Preishuber, 2018, Depreciating motivation and empirical security analysis of chaos-based image and video encryption, IEEE Trans Inf Forensics Secur source
    • cites [1] Li, 2018, Cryptanalysis of a chaotic image encryption algorithm based on information entropy, IEEE Access source

      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)

      Experimental — accuracy not yet measured
  • May combine two claims.

    Findingcitation

    Based on [16] and [18], both the equivalent secret key of Pak et al.'s scheme and all its unknown parameters can be recovered with a few more chosen plain-image/cipher-image pairs.

    “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].”
    Quote in the paperSubstantial claim1 of 3 sources checked
    • cites [16] Wang, 2018, Cryptanalysis and enhancements of image encryption using combination of the 1D chaotic map, Signal Process source
    • cites [18] Chen, 2018, Cryptanalysis and improvement in an image encryption scheme using combination of the 1D chaotic map, Nonlinear Dyn source
    • cites [19] Zhu, 2018, Improved cryptanalysis and enhancements of an image encryption scheme using combined 1D chaotic maps, Entropy source
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationnone given

    The correlation among blocks in cipher-images may still facilitate optimizing attacks on block-wise permutation schemes with advanced jigsaw puzzle solvers.

    “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.”
    Quote in the paperNot a substantial claim2 of 2 sources checked
    • cites [114] Imaizumi, 2018, A block-permutation-based encryption scheme with independent processing of RGB components, IEICE Trans Inf Syst source
    • cites [115] Li, 2016, Cracking a hierarchical chaotic image encryption algorithm based on permutation, Signal Process source
  • May combine two claims.

    Findingcitation

    The encryption-then-compression framework of Kiya et al. does not seriously influence further compression and can withstand attacks based on conventional jigsaw puzzle solvers.

    “Such encryption-then-compression framework does not seriously influence the further compression and can withstand the attacks based on conventional jigsaw puzzle solvers [113].”
    Quote in the paperNot a substantial claim1 of 1 sources checked
    • cites [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 source

      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)

      Experimental — accuracy not yet measured
  • May combine two claims.

    Findingcitation

    In [94], PWLCM is adopted as the source producing PRNS, whose randomness is seriously compromised in a digital computer.

    “Interestingly, [94] adopts PWLCM as the source producing pseudo-random number sequence, whose randomness is seriously comprised in a digital computer [48].”
    Quote in the paperNot a substantial claim1 of 2 sources checked
    • cites [94] Puteaux, 2018, An efficient MSB prediction-based method for high-capacity reversible data hiding in encrypted images, IEEE Trans Inf Forensics Secur source
    • cites [48] Li, 2019, Dynamic analysis of digital chaotic maps via state-mapping networks, IEEE Trans Circuits Syst I source

      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)

      Experimental — accuracy not yet measured
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    The periods of PRNS obtained by iterating Logistic map and skew tent map in a digital computer are rigorously analyzed in [48].

    “The periods of PRNS obtained by iterating Logistic map and skew tent map in digital computer are rigorously analyzed in [48].”
    Quote in the paperNot a substantial claim1 of 1 sources checked
    • cites [48] Li, 2019, Dynamic analysis of digital chaotic maps via state-mapping networks, IEEE Trans Circuits Syst I source

      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)

      Experimental — accuracy not yet measured
  • Probably not a substantial claim: may not pass S4 (based).

    Findingnone given

    Almost all image cryptanalysis works published in 2018 are surveyed because their number is small.

    “Almost all image cryptanalysis works published in 2018 are surveyed due to their small number.”
    Quote in the paperNot a substantial claim
    • Rests on an assumption: The selected works are representative of the image encryption and cryptanalysis works proposed in 2018.
  • May combine two claims.

    Findingcitation

    In [125], the usability of a 4-round diffusion-then-permutation without substitution-box is questioned, and it can be considered a special form of 5-round PTDWOS.

    “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.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [125] Dhall, 2018, Cryptanalysis of image encryption scheme based on a new 1D chaotic system, Signal Process source
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Findingnone given

    About 30 papers on image cryptanalysis were published in 2018.

    “In the year 2018, about 30 papers on image cryptanalysis were published.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingcitation

    In [125], a linear relationship between plain-image and cipher-image is derived because the adopted permutation is a static rotation of 90 degrees, and this supports the proposed differential attack.

    “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.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [125] Dhall, 2018, Cryptanalysis of image encryption scheme based on a new 1D chaotic system, Signal Process source
  • May combine two claims.

    Findingcitation

    In [76], only the four most significant bits of compressed samples are encrypted, which may cause some and even all visual information of the encrypted object to be revealed.

    “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.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [76] Pudi, 2018, Secure and lightweight compressive sensing using stream cipher, IEEE Trans Circ SystII source
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingcitation

    Among reversible and irreversible gates including XOR, Toffoli and Fredkin gates, only the Fredkin gate can help the supported encryption scheme withstand chosen-ciphertext attack.

    “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.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [131] Annaby, 2018, On security of image ciphers based on logic circuits and chaotic permutations, Multimed Tools Appl source
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingcitation

    In [133], coefficients of the nominal matrix of a stream cipher based on an 8-D self-synchronous chaotic system can be derived in known-plaintext and chosen-ciphertext attack scenarios.

    “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.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [133] Lin, 2018, Cryptanalysis of a chaotic stream cipher and its improved scheme, Int J Bifur Chaos source
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingcitation

    Using the strong correlation among neighboring bits in every bit-plane in a natural image, a ciphertext-only attack can recover an approximate version of the original plain-image with good visual quality.

    “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.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [34] Khelifi, 2018, On the security of a stream cipher in reversible data hiding schemes operating in the encrypted domain, Signal Process source
  • May combine two claims.

    Interpretationcitation

    The most striking image cryptanalysis work in 2018 is [116], which refutes any superiority of chaos-based encryption schemes over several variants of AES in computational effort and security performance.

    “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”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [116] Preishuber, 2018, Depreciating motivation and empirical security analysis of chaos-based image and video encryption, IEEE Trans Inf Forensics Secur source
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.

    Interpretationnone given

    Once basic encryption operations are repeated for some rounds or an S-box is used, the structure of the whole encryption scheme becomes much more complex, which dramatically increases the hardship of cryptanalysis.

    “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.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationnone given

    Deep learning can also be used to test the security of an encryption scheme via adversarial training.

    “Actually, deep learning can also be used to test security of an encryption scheme via adversarial training.”
    Quote in the paperNot a substantial claim
  • Classified as probably not a substantial claim.

    Premisecitation

    Statistical testing cannot serve as a substitute for cryptanalysis.

    “As emphasized in the abstract of the special report on PRNG test suite of NIST,”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    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.

    “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.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Interpretationreasoning

    The encryption schemes designed in [52,37] are both vulnerable to chosen-plaintext attack because only one round of the two basic operations are used.

    “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.”
    Quote in the paperSubstantial claim0 of 2 sources checked
    • cites [52] Liu, 2018, A new simple chaotic system and its application in medical image encryption, Multimed Tools Appl source
    • cites [37] Muhammad, 2018, Secure surveillance framework for IoT systems using probabilistic image encryption, IEEE Trans Ind Inf source
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Premisenone given

    S-box is an efficient way to obscure the relationship between the secret key and the cipherimage.

    “As a lookup table, S-box is an efficient way to obscure the relationship between the secret key and the cipherimage.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S2 (checkable).

    Interpretationcitation

    Prejudice on the value of cryptanalysis obstructs the progress of image security.

    “Prejudice on the value of cryptanalysis obstructs the progress of image security.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationnone given

    S-box is seldom adopted in image encryption schemes.

    “Strangely enough, it is seldom adopted in image encryption schemes.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).

    Interpretationcitation

    Authors proposing a successful attack on a given image encryption scheme may not have comprehensive knowledge on designing secure image encryption schemes.

    “-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.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [30] Diab, 2018, Secure image cryptosystem with unique key streams via hyper-chaotic system, Signal Process source
  • The quote only partly states this claim.

    Interpretationreasoning

    Not following the basic rules and general guidelines makes essential improvement on the security level of the analyzed schemes very hard.

    “which makes essential improvement on the security level of the analyzed schemes very hard.”
    Quote in the paperNot a substantial claim
25 of 25
  • 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.”
2 of 2

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.

  • Cites a retracted work: 10.1371/journal.pone.0206460

    Info

    The cited work was retracted on 2025-12-17 (notice 10.1371/journal.pone.0338963), not before this paper was published (2019-10).

    Cited work 10.1371/journal.pone.0206460 · retracted 2025-12-17 · notice 10.1371/journal.pone.0338963 · this paper published 2019-10

  • Cites a retracted work: 10.1007/s00521-016-2511-5

    Info

    The cited work was retracted on 2024-07-22 (notice 10.1007/s00521-024-10125-1), not before this paper was published (2019-10).

    Cited work 10.1007/s00521-016-2511-5 · retracted 2024-07-22 · notice 10.1007/s00521-024-10125-1 · this paper published 2019-10

2 of 2

Cites

2 retracted

Flagged first, then by citations

Research works printed but not linked: 1

  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

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
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.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-23.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-23.

Cited sources are checked by 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