Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Large encrypting binary images with higher security
Pattern Recognition Letters
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata
IEEE Transactions on Computers
A new encryption algorithm for image cryptosystems
Journal of Systems and Software
Cryptanalysis of a Partially Known Cellular Automata Cryptosystem
IEEE Transactions on Computers
Image Encryption and Decryption Using SCAN Methodology
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Image security system using recursive cellular automata substitution
Pattern Recognition
Cryptanalysis of the RCES/RSES image encryption scheme
Journal of Systems and Software
Novel Stream Cipher Using 2-D Hybrid CA and Variable Ordered Recursive CA Substitutions
NPC '08 Proceedings of the 2008 IFIP International Conference on Network and Parallel Computing
On the security defects of an image encryption scheme
Image and Vision Computing
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Recently, a novel image encryption scheme using progressive cellular automata (CA) substitution and SCAN was proposed. This paper analyzes the security of the scheme and reports the following problems: 1) the scheme is not sensitive to the changes of plain-images; 2) the scheme is not sensitive to the changes of the key streams generated by CA; 3) there are some problems about the secret key of the scheme; 4) the scheme can be broken with no more than ⌊logL(MN)⌋+1 chosen-images when the two basic parts of the scheme are not iterated, where MN is the number of pixels of the plain-image and L is the number of all possible different pixel values. Moreover, the strength against known/chosen-plaintext attack is also discussed briefly when the iteration number of the two basic parts is more than one.