Loading...
Please wait, while we are loading the content...
Similar Documents
On the security of an image encryption scheme.
| Content Provider | CiteSeerX |
|---|---|
| Author | Chengqing Li, A. Shujun Li, B. Muhammad Asim, C. Juana Nunez, D. Gonzalo Alvarez, D. Guanrong Chen, A. |
| Abstract | This paper studies the security of a recently-proposed image encryption scheme based on chaos, and points out the following problems: 1) there exist a number of invalid keys and weak keys, and some keys are partially equivalent for the encryp-tion/decryption processes; 2) given one chosen plain-image, a sub-key K10 can be guessed with a smaller computational complexity than that of the simple brute-force attack; 3) given O(10) (at most 128) chosen plain-images, a chosen-plaintext attack may be able to break the following part of the secret key: ({Ki mod 128}9i=4,K10), which works very well when K10 is not too large; 4) when K10 is relatively small, a known-plaintext attack can be mounted with only one known plain-image to recover some visual information of other plain-images encrypted by the same key. Key words: cryptanalysis, image encryption, chaos, known-plaintext attack, chosen-plaintext attack 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Image Encryption Scheme Chosen-plaintext Attack Known-plaintext Attack Computational Complexity Following Part Invalid Key Visual Information Image Encryption Sub-key K10 Simple Brute-force Attack Paper Study Secret Key Encryp-tion Decryption Recently-proposed Image Encryption Scheme Weak Key |
| Content Type | Text |
| Resource Type | Article |
