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

A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks

Li, Shujun, Li, Chengqing, Chen, Guanrong, Bourbakis, Nikolaos G., Lo, Kwok-Tung·2008·Signal Processing: Image Communication

Integrity signals

Registry

Crossref · 10.1016/j.image.2008.01.003

Cites

72 of 72 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Every permutation-only multimedia encryption scheme acting on a plaintext of size M×N can be represented as a permutation matrix W over the M×N position grid, regardless of the permuted element values.

    “no matter what the permuted elements of multimedia data are, all permutationonly multimedia encryption schemes on a plaintext of size M × N can be represented as”
  • Substituting n0 with ⌈log_L(MN)⌉, the attack complexity becomes O(⌈log_L(MN)⌉·MN), which is much lower than the O(⌈log_L(MN)⌉·MN2) estimated in [20].

    “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].”
  • Any permutation-only multimedia encryption scheme acting on a plaintext of size M×N can be efficiently broken with O(⌈log_L(MN)⌉) known/chosen plaintexts.

    “we can conclude that any permutation-only multimedia encryption schemes exerting on plaintext of size M × N can be efficiently broken with O ( ⌈ log L ( MN ) ⌉ ) known/chosen-plaintexts”
  • A general algorithm for obtaining the permutation matrix by comparing the values of elements of some plaintexts and corresponding ciphertexts was proposed in [20].

    “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.”
  • The flat slopes for n0 ≥ 25 are due to the negative impact of strong redundancy in natural images, such as neighboring pixels' MSBs being the same with high probability.

    “This is due to the negative impact incurred by the strong redundancy in natural images such as the MSBs of neighboring pixels are the same with a high probability.”

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. Brown, 1990, Comparing the security of pay-TV systems for use in Australia, Austral. Telecomm. Res., 24, 1

Cited by

Sorted by citations

Authors
Li, S., Li, C., Chen, G., Bourbakis, N. G., & Lo, K.-T.
Affiliations
  • FernUniversität in Hagen (DE)
  • City University of Hong Kong (HK)
  • Wright State University (US)
  • Hong Kong Polytechnic University (HK)
Corresponding author
Li, Shujun
Venue
Signal Processing: Image Communication
Publisher
Elsevier BV
Published
2008-03
Volume
23
Issue
3
Pages
212-223
ISSN
0923-5965 (ISSN-L)
OpenAlex
W2008604527
Cited by
324
References
72
Citations by year
2026: 4 · 2025: 4 · 2024: 7 · 2023: 11 · 2022: 10 · 2021: 21 · 2020: 21 · 2019: 21 · 2018: 27 · 2017: 37 · 2016: 24 · 2015: 28 · 2014: 31 · 2013: 20 · 2012: 17
FWCI
19.56
Type
journal article
Language
en
Open access
closed
Locations
  • Signal Processing Image Communication (publishedVersion)
  • PolyU Institutional Research Archive (Hong Kong Polytechnic University) (submittedVersion)
Funders
  • Hong Kong Polytechnic University (5232/06E, G-YX63)
  • Alexander von Humboldt-Stiftung
  • Research Grants Council, University Grants Committee (523206)
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
multimedia encryption, known-plaintext attack, chosen-plaintext attack, attack complexity, information hiding

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.

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