The Cryptanalysis of an Image Scrambling Algorithm Based on Arnold Transformation
Lequan Min · Journal of Wuhan University · 2011
The security of an Arnold transformation-based image scrambling algorithm is analyzed in this paper.One time global scrambling and one time intersected scrambling are carried on plain-images.The key space of the algorithm is too small to against the exhaust attacks based on the ciphertext-only attack.A deterministic relationship among equivalent keys of Arnold transformations is derived by the chosen-plaintext attack.The relationship can effectively decrease the key space of the whole cryptosystem,thereby obtaining the keys with smaller computational expense.The results of the theory and experiment verify that the cryptosystem is not secure enough.