811 research outputs found
Image Encryption Based on Diffusion and Multiple Chaotic Maps
In the recent world, security is a prime important issue, and encryption is
one of the best alternative way to ensure security. More over, there are many
image encryption schemes have been proposed, each one of them has its own
strength and weakness. This paper presents a new algorithm for the image
encryption/decryption scheme. This paper is devoted to provide a secured image
encryption technique using multiple chaotic based circular mapping. In this
paper, first, a pair of sub keys is given by using chaotic logistic maps.
Second, the image is encrypted using logistic map sub key and in its
transformation leads to diffusion process. Third, sub keys are generated by
four different chaotic maps. Based on the initial conditions, each map may
produce various random numbers from various orbits of the maps. Among those
random numbers, a particular number and from a particular orbit are selected as
a key for the encryption algorithm. Based on the key, a binary sequence is
generated to control the encryption algorithm. The input image of 2-D is
transformed into a 1- D array by using two different scanning pattern (raster
and Zigzag) and then divided into various sub blocks. Then the position
permutation and value permutation is applied to each binary matrix based on
multiple chaos maps. Finally the receiver uses the same sub keys to decrypt the
encrypted images. The salient features of the proposed image encryption method
are loss-less, good peak signal-to-noise ratio (PSNR), Symmetric key
encryption, less cross correlation, very large number of secret keys, and
key-dependent pixel value replacement.Comment: 14 pages,9 figures and 5 tables;
http://airccse.org/journal/jnsa11_current.html, 201
Cryptanalysis of an Image Encryption Scheme Based on a Compound Chaotic Sequence
Recently, an image encryption scheme based on a compound chaotic sequence was
proposed. In this paper, the security of the scheme is studied and the
following problems are found: (1) a differential chosen-plaintext attack can
break the scheme with only three chosen plain-images; (2) there is a number of
weak keys and some equivalent keys for encryption; (3) the scheme is not
sensitive to the changes of plain-images; and (4) the compound chaotic sequence
does not work as a good random number resource.Comment: 11 pages, 2 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
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
Chosen-plaintext attack of an image encryption scheme based on modified permutation-diffusion structure
Since the first appearance in Fridrich's design, the usage of
permutation-diffusion structure for designing digital image cryptosystem has
been receiving increasing research attention in the field of chaos-based
cryptography. Recently, a novel chaotic Image Cipher using one round Modified
Permutation-Diffusion pattern (ICMPD) was proposed. Unlike traditional
permutation-diffusion structure, the permutation is operated on bit level
instead of pixel level and the diffusion is operated on masked pixels, which
are obtained by carrying out the classical affine cipher, instead of plain
pixels in ICMPD. Following a \textit{divide-and-conquer strategy}, this paper
reports that ICMPD can be compromised by a chosen-plaintext attack efficiently
and the involved data complexity is linear to the size of the plain-image.
Moreover, the relationship between the cryptographic kernel at the diffusion
stage of ICMPD and modulo addition then XORing is explored thoroughly
A Differential Cryptanalysis of Yen-Chen-Wu Multimedia Cryptography System (MCS)
At ISCAS'2005, Yen et al. presented a new chaos-based cryptosystem for
multimedia transmission named "Multimedia Cryptography System" (MCS). No
cryptanalytic results have been reported so far. This paper presents a
differential attack to break MCS, which requires only seven chosen plaintexts.
The complexity of the attack is O(N), where is the size of plaintext.
Experimental results are also given to show the real performance of the
proposed attack.Comment: 22 pages, 5 figure
On the security of the Yen-Guo's domino signal encryption algorithm (DSEA)
Recently, a new domino signal encryption algorithm (DSEA) was proposed for
digital signal transmission, especially for digital images and videos. This
paper analyzes the security of DSEA, and points out the following weaknesses:
1) its security against the brute-force attack was overestimated; 2) it is not
sufficiently secure against ciphertext-only attacks, and only one ciphertext is
enough to get some information about the plaintext and to break the value of a
sub-key; 3) it is insecure against known/chosen-plaintext attacks, in the sense
that the secret key can be recovered from a number of continuous bytes of only
one known/chosen plaintext and the corresponding ciphertext. Experimental
results are given to show the performance of the proposed attacks, and some
countermeasures are discussed to improve DSEA.Comment: 11 pages, 5 figure
- …