Abstract
In this article, we described specifics of pixels permutations based on the discretized, two-dimensional Chirikov standard map. Some properties of the discretized Chirikov map can be used by an attacker to recover the original images that are studied. For images with dimensions N ´ N the vulnerability of permutations allows for brute force attacks, and shown is the ability of an intruder to restore the original image without setting the value of keys permutations. Presented is also, successful cryptographic attack on the encrypted image through permutation of pixels. It is found that for images with dimension N ´ N the maximum number of combinations is equal to NN-1. A modified Chirikov map was proposed with improved permutation properties, due to the use of two nonlinearities, that increase the keys space to N2!.
Subject
General Earth and Planetary Sciences,General Engineering,General Environmental Science
Reference15 articles.
1. Alvarez, G., Li, S. J.: Some Basic Cryptographic Requirements for Chaos-Based Cryptosystems. Inter. Journal of Bif. and Chaos 16(8)/2006, 2129–2151.
2. Argyris A., Syvridis D., Larger L., Annovazzi-Lodi V., Colet P., Fischer I., García-Ojalvo J., Mirasso C.R., Pesquera L., Shore K.A.: Chaos-based communications at high bit rates using commercial fibre-optic links. Nature 438(7066)/2005, 343–346.
3. Arroyo D., Alvarez G., Fernandez V.: A basic framework for the cryptanalysis of digital chaos-based cryptography. Proc. of the 6th International Multi-Conference on Systems, Signals and Devices, Djerba 2009, 58–63.
4. Chirikov B. V.: Research concerning the theory of nonlinear resonance and stochasticity Preprint 267, Institute of Nuclear Physics, Novosibirsk, 1969, (Engl. Trans., CERN Trans. 1971, 71–40).
5. Fridrich J.: Symmetric Ciphers Based on Two-Dimensional Chaotic Maps. Inter. Journal of Bif. and Chaos 8(6)/1998, 1259–284.