On the security defects of an image encryption scheme
Chengqing Li, Shujun Li, Muhammad Asim, Juana Nunez, Gonzalo Alvarez,, Guanrong Chen

TL;DR
This paper critically analyzes a chaos-based image encryption scheme, revealing multiple security vulnerabilities including weak keys, susceptibility to chosen-plaintext and known-plaintext attacks, and partial key recovery.
Contribution
It identifies specific security flaws in a recent chaos-based encryption scheme and demonstrates practical attack methods exploiting these weaknesses.
Findings
Existence of invalid and weak keys in the scheme
Ability to guess subkey $K_{10}$ with reduced complexity
Challenged the scheme's resistance to chosen-plaintext and known-plaintext attacks
Abstract
This paper studies the security of a recently-proposed chaos-based image encryption scheme, and points out the following problems: 1) there exist a number of invalid keys and weak keys, and some keys are partially equivalent for encryption/decryption; 2) given one chosen plain-image, a subkey can be guessed with a smaller computational complexity than that of the simple brute-force attack; 3) given at most 128 chosen plain-images, a chosen-plaintext attack can possibly break the following part of the secret key: , which works very well when is not too large; 4) when is relatively small, a known-plaintext attack can be carried out with only one known plain-image to recover some visual information of any other plain-images encrypted by the same key.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Mathematical Dynamics and Fractals · Advanced Steganography and Watermarking Techniques
