916 research outputs found
On the security of a new image encryption scheme based on chaotic map lattices
This paper reports a detailed cryptanalysis of a recently proposed encryption
scheme based on the logistic map. Some problems are emphasized concerning the
key space definition and the implementation of the cryptosystem using
floating-point operations. It is also shown how it is possible to reduce
considerably the key space through a ciphertext-only attack. Moreover, a timing
attack allows the estimation of part of the key due to the existent
relationship between this part of the key and the encryption/decryption time.
As a result, the main features of the cryptosystem do not satisfy the demands
of secure communications. Some hints are offered to improve the cryptosystem
under study according to those requirements.Comment: 8 pages, 8 Figure
Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks
Recently, an image scrambling encryption algorithm of pixel bit based on
chaos map was proposed. Considering the algorithm as a typical binary image
scrambling/permutation algorithm exerting on plaintext of size ,
this paper proposes a novel optimal method to break it with some
known/chosen-plaintexts. The spatial complexity and computational complexity of
the attack are only and respectively,
where is the number of known/chosen-plaintexts used. The method can be
easily extended to break any permutation-only encryption scheme exerting on
plaintext of size and with different levels of values. The
corresponding spatial complexity and computational complexity are only
and respectively. In addition, some
specific remarks on the performance of the image scrambling encryption
algorithm are presented.Comment: 11 pages, 6 figure
Cryptanalysis of two chaotic encryption schemes based on circular bit shift and XOR operations
Recently two encryption schemes were proposed by combining circular bit shift
and XOR operations, under the control of a pseudorandom bit sequence (PRBS)
generated from a chaotic system. This paper studies the security of these two
encryption schemes and reports the following findings: 1) there exist some
security defects in both schemes; 2) the underlying chaotic PRBS can be
reconstructed as an equivalent key by using only two chosen plaintexts; 3) most
elements in the underlying chaotic PRBS can be obtained by a differential
known-plaintext attack using only two known plaintexts. Experimental results
are given to demonstrate the feasibility of the proposed attack.Comment: 17 pages, 8 figure
Breaking an image encryption algorithm based on chaos
Recently, a chaos-based image encryption algorithm called MCKBA (Modified
Chaotic-Key Based Algorithm) was proposed. This paper analyzes the security of
MCKBA and finds that it can be broken with a differential attack, which
requires only four chosen plain-images. Performance of the attack is verified
by experimental results. In addition, some defects of MCKBA, including
insensitivity with respect to changes of plain-image/secret key, are reported.Comment: 10 pages, 4 figure
- …