International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print),

ISSN 0976 - 6375(Online), Volume 5, Issue 9, September (2014), pp. 90-97 IAEME
90











AN ALGORITHM TO SECURE AN IMAGE USING LOGISTIC CHAOTIC
MAPPING WITH SHUFFLING


Geeta

M.Tech, UTU, CSE Department

Anubhooti Papola

Assistant Professor, UTU, CSE Department



ABSTRACT

In the internet era security of communication is one of the major issues. Use of internet as
communication medium increases numerous security threats. Security of digital image is one of the
great issues when it is travels through internet. The approaches used in encryption of text are not
suitable for image encryption. Some of image properties such as redundancy of data, strong
correlation among adjacent pixels being less sensitive as compared to text data. Due to that it is
difficult to use of traditional encryption approached such as IDEA, AES, DES & RSA etc are for real
image encryption. Chaos has some properties which are similar to cryptography. Due to this the use
of chaotic maps are increased in image encryption. In this paper we proposed a hybrid image
encryption approach which has both position permutation based image encryption and value
transformation based image encryption.[5]

Keywords: Image Encryption, Secret Key, Logistic Chaotic Map, Correlation-Coefficient,
Histogram.

INTRODUCTION

In recent year multimedia massages takes vast space in place of dull text messages. For
exchange of these increase an obsession of interne. Universal acceptance, easy to use and freedom of
speech make manoeuvre of internet straightforward but give rise to a number of security issues. In
that case it is compulsory to secure our conversation or image [1, 2, 4, 6,]. Image encryption
basically belongs to the security of an image when in travels in a communication medium where
INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING &
TECHNOLOGY (IJCET)



ISSN 0976 6367(Print)
ISSN 0976 6375(Online)
Volume 5, Issue 9, September (2014), pp. 90-97
IAEME: www.iaeme.com/IJCET.asp
Journal Impact Factor (2014): 8.5328 (Calculated by GISI)
www.jifactor.com

IJCET
I A E M E
International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print),
ISSN 0976 - 6375(Online), Volume 5, Issue 9, September (2014), pp. 90-97 IAEME
91

number of unauthorized persons is available to traps this. Basically in image Encryption we convert
it into a meaningless image which is not understood by any one. For this a number of encryption
process are used. For image encryption three types of processes are used[7,8]-

1. Position permutation based image encryption algorithms: - In that the position of image
pixels are arranged again and again means rearrangement of image pixels.
2. Value transformation based image encryption algorithms: - In that the value of image
pixels are modified according to any function or any operation.
3. Visual transformation based image encryption algorithm: - In that work has done on image
resolution not in pixel values.[11,12]

Todays chaotic maps are widely used in image encryption. Chaotic maps have many
fundamental properties such as Ergodicity, mixing properties and sensitivity to initial
condition/system parameters. These properties are equivalent to some cryptographic properties of a
cipher text such as confusion, diffusion, and balance and avalanche property. [14, 15, 16]

RELATIONSHIP BETWEEN CHAOS THEORY AND CRYPTOGRAPHY

Table 1: Relationship between Chaos Theory and Cryptography
Sl. No. Chaos Theory Cryptography
1.
2.
3.
4.
5.
6.
7.
8.

9.
Chaotic System
Non-linear transform
Infinite number of states
Infinite number of iterations
Initial State
Final State
Initial conditions &/or parameters
Asymptotic independence of initial and
final states
Sensitive to initial conditions and
parameter mixing
Pseudo-chaotic system
Non- linear transform
Finite number of states
Finite iteration
Plain text
Cipher Text
Key
Confusion

Diffusion

We proposed an algorithm which have low correlation coefficient, no similarity of the
histogram of encrypted image and original image and provide high randomness with large key space.
In this we used secret key as well as logistic chaotic map.

International Journal of Computer Engineering and Technology (IJCET), ISSN 0976
ISSN 0976 - 6375(Online), Volume 5, Issue

Proposed Algorithm- The proposed algorithm is uses both the position permutation and value
transformation. In this method first I modified the value of image pixels (value transformation), then
shuffle the image pixels (position permutation) and again do value transformation

Algorithm

1. Take an external 40 bit key in hexadecimal format.

2. Make 4 bit 10 session keys.

3. Convert the key into decimal values.

4. for calculating initial value for logistic map do


5. Calculate the value of first logistic map using the

x=3.99*xinc(1-xinc)

6. Modify the image pixel values using key values.

7. Again modify the pixel values using xor and complement operation.

8. Shuffle the image pixel values making different block of images. Here I used 4 block of pixels.

9. Using encryption/decryption method making different group using the value given by logistic
map. Apply following operations on the basic of value of logistic map.

Table 2: Encryption Operations
Sl. No. Value of Logistic Map
1. 0.1 to 0.3
2. 0.3 to 0.6
3. 0.6 to 0.9




International Journal of Computer Engineering and Technology (IJCET), ISSN 0976
6375(Online), Volume 5, Issue 9, September (2014), pp. 90-97 IAEME
92
The proposed algorithm is uses both the position permutation and value
transformation. In this method first I modified the value of image pixels (value transformation), then
shuffle the image pixels (position permutation) and again do value transformation.
1. Take an external 40 bit key in hexadecimal format.
3. Convert the key into decimal values.
4. for calculating initial value for logistic map do
5. Calculate the value of first logistic map using the equation

6. Modify the image pixel values using key values.
7. Again modify the pixel values using xor and complement operation.
8. Shuffle the image pixel values making different block of images. Here I used 4 block of pixels.
. Using encryption/decryption method making different group using the value given by logistic
map. Apply following operations on the basic of value of logistic map.
Table 2: Encryption Operations
Value of Logistic Map Operation Performed
Nor and xor operation with key k1 and k10
Nor operation
Mod operation with 256 with the help of k2 and k3
International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print),
IAEME
The proposed algorithm is uses both the position permutation and value
transformation. In this method first I modified the value of image pixels (value transformation), then
8. Shuffle the image pixel values making different block of images. Here I used 4 block of pixels.
. Using encryption/decryption method making different group using the value given by logistic
Nor and xor operation with key k1 and k10
Mod operation with 256 with the help of k2 and k3
International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print),
ISSN 0976 - 6375(Online), Volume 5, Issue 9, September (2014), pp. 90-97 IAEME
93

IMPLEMENTATION OF ALGORITHM


(a)


(b)

Figure1:- (a) shows different steps of encryption of an image whereas (b) shows different steps
of decryption of an image with key b98fdab563

Analysis of algorithm:- A good quality encryption method must be robust against all kinds of
statistical, cryptanalytic, and brute-force attacks. In this segment, it talk about the security analysis of
the projected image encryption plan such as statistical study, sensitivity study with respect to the
plaintext and key, key space analysis etc. to demonstrate that the anticipated cryptosystem is
protected against the most general attacks. It is fine known that numerous ciphers have been
effectively analyzed by means of the help of statistical study and several arithmetical attacks have
been formulates on them. Therefore, a perfect cipher should be vigorous against any statistical hit.

Correlation coefficient (CC) analysis:- Correlation coefficient is a calculation of the association
(linear dependence) between two variables X and Y, which give a value between +1 and 1.

International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print),
ISSN 0976 - 6375(Online), Volume 5, Issue 9, September (2014), pp. 90-97 IAEME
94

Table 3: Correlation coefficient with key b98fdab563
Name of
Picture
Size CC (OI 2 EI) CC (OI 2 DI) key
Woman 230*172 0.0035 0.9997






b98fdab563
Flower 251*201 0.0019 1.0000
Tajmahal 229*170 0.0025 1.0000
Krishna 201*250 0.0028 1.0000
Nature 275*183 0.0018 1.0000
Bird 284*177 0.0018 1.0000
Animal 256*192 0.0013 0.9996
Cake 256*341 0.0022 1.0000
Rangoli 256*144 0.0014 1.0000
Picture 256*192 0.0014 1.0000
Car 250*113 0.0028 1.0000
Bridge 256*159 0.0039 1.0000
Airplane 255*170 0.0029 1.0000
Baby 250*187 0.0020 1.0000
Picturebridg 250*187 0.0037 1.0000


Histogram Analysis: - For an "image histogram is a histogram which takes action as a graphical
demonstration of the equal distribution of image pixels in an image. It maps the number of pixels for
each color value. By analyzing the histogram for a particular image a viewer may be able to guess
the entire tonal (color) distribution at the image. A histogram shows fundamental information about
the data set, such as width of spread, central location, and shape. Use histograms to evaluate the
International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print),
ISSN 0976 - 6375(Online), Volume 5, Issue 9, September (2014), pp. 90-97 IAEME
95

systems existing situation and to revise results of upgrading actions. The histograms shape and
arithmetic information help to decide how to advance the system. Figure 2 shows (a) histogram of
original image, (b) histogram of encrypted image whereas (c) histogram of decrypted image.



(a) (b)


(c)
Figure2: Shows (a) histogram of original image, (b) histogram of encrypted image and (c)
histogram of decrypted image

Key Space and Key Sensitive Analysis:-For a secure image cipher and good encryption approach,
the key space must be large enough which formulate the brute force hit infeasible. The projected
image cipher has 2
40
=109*10
12
different groupings of the secret key. A picture cipher with this long
key space is adequate for reliable convenient use. On the other hand, one can have longer or greater
key for image encryption or decryption in the projected image cipher and it can be effortlessly
integrated in the algorithm by making minor modification. For that purpose, the proposed work has
to decrease interval amount shorter than the one. A longer key would have need of supplementary
computational point in moment for decryption/encryption which may not or may be preferable for
genuine time communication. In the predictable image cipher, one chaotic map is engaged for
encryption/decryption which is responsive on the initial circumstances. The original conditions for
the logistic maps are premeditated from the surreptitious key with different method.
International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print),
ISSN 0976 - 6375(Online), Volume 5, Issue 9, September (2014), pp. 90-97 IAEME
96

FUTURE SCOPE

For protection of any information encryption operation is performed if it is necessary. In
general in the first step an appropriate compression algorithm is applied to multimedia data and in
the second step its output is encrypted by an independent encryption algorithm. The proposed
algorithm provides vast future opportunities. It can further use this algorithm for colored image.
Presently the algorithm is applicable only grey scale image. Due to some problems with logistic
chaotic map it can be possible in future use another chaotic map for encryption. In future step of
shuffling of pixel may be increased and shuffling become stronger.

CONCLUSION

The proposed algorithm introduces an encryption approach, how it is work, what its security
and how better it is than other algorithms. A number of image encryption approaches are proposed.
Most of the previous algorithms give a similar histogram which weak the encryption algorithm. A
lesser amount of randomness provides better chance of statistical attack. High correlation coefficient
make image insecure. The proposed encryption/ decryption algorithm provides low correlation
coefficient, no similarity of the histogram of encrypted image and original image and provide high
randomness. With all these features its also provided high sensitivity regarding initial value and
parameters and also accomplished a large key space.

REFRENCES

[1] J. Fridrich, Symmetric ciphers based on two-dimensional chaotic maps. International
Journal of Bifurcation and Chaos, Vol.8, pp.1259-1284, 1998.
[2] Q.Hua Lin, Fu-Liang Yin, and Y.R. Zheng Secure image communication using blind source
separation IEEE,2004.
[3] N.K. Pareek, Vinod Patidar, K.K. Sud, Cryptography using multiple one-dimensional
chaotic maps, Commun. Nonlinear Sci. Numer. Simul. pp. 715723, 2005.
[4] K.C. Ravishankar, M.G. Venkateshmurthy Region Based Selective Image Encryption
IEEE, 1-424-0220-4/06, 2006.
[5] N.K. Pareek, Sud. Image encryption using chaotic logistic map. Image and Vision
Computing , 24, pp.9269, 2006.
[6] Musheer Ahmad and M. Shamsher Alam, A New Algorithm of Encryption and Decryption
of Images Using Chaotic Mapping, International Journal on Computer Science and
Engineering, Vol.2(1), pp. 46-50, 2009.
[7] Z.Yun-peng , Z. Zheng-jun Digital Image Encryption Algorithm Based on Chaos and
Improved DES Proceedings of IEEE International Conference on Systems, 2009.
[8] Ai-hongZhu, Lia Li, Improving for Chaotic Image Encryption Algorithm Based on Logistic
Map, 2
nd
Conference on Environmental Science and Information Application Technology,
2010.
[9] G.A.Sathishkumar, Dr.K.Bhoopathy bagan and Dr.N.Sriraam Image Encryption Based on
Diffusion and Multiple Chaotic Maps, International Journal of Network Security & Its
Applications (IJNSA), Vol.3, No.2, March 2011.
[10] K. Sakthidasan and B. V. Santhosh Krishna A New Chaotic Algorithm for Image
Encryption and Decryption of Digital Color Images International Journal of Information and
Education Technology, Vol. 1, No. 2, June 2011.
International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print),
ISSN 0976 - 6375(Online), Volume 5, Issue 9, September (2014), pp. 90-97 IAEME
97

[11] Xin Ma, Chong Fu, Wei-min Lei, Shuo Li A Novel Chaos-based Image Encryption Scheme
with an Improved Permutation Process, International Journal of Advancements in
Computing Technology Volume3, Number5, June 2011.
[12] Ahadpour S., Sadra Y., ArastehFrad Z., A Novel Chaotic Image Encryption using
Generalized Threshold Function International Journal of Computer Applications, pp. 25-31,
2012.
[13] Hazem Mohammad Al-Najjar and Asem Mohammad AL-Najjar Multi-Chaotic Image
Encryption Algorithm Based on One Time Pads Scheme International Journal of Computer
Theory and Engineering, Vol. 4, June 2012.
[14] R. liu, X. tian New algorithm for color image encryption using chaotic map and spatial bit
level permutation Journal of Theoretical and Applied Information Technology 15 September
2012. Vol. 43 No.1, 2005 2012.
[15] F. K. Tabash, M.Q. Rafiq, M. Izharrudin Image Encryption Algorithm based on Chaotic
Map, International Journal of Computer Applications (0975 8887) Volume 64,
February 2013.
[16] Geeta, Anubhooti Papola A Survey on Different Chaotic Encryption Approaches, First
International Online Conference on Research in Science, Engineering and Management,
2014.
[17] Ahmad Salameh Abusukhon, Block Cipher Encryption for Text-To-Image Algorithm,
International Journal of Computer Engineering & Technology (IJCET), Volume 4, Issue 3,
2013, pp. 50 - 59, ISSN Print: 0976 6367, ISSN Online: 0976 6375.
[18] Prof. Maher K. Mahmood and Jinan N. Shehab, Image Encryption and Compression Based
on Compressive Sensing and Chaos, International Journal of Computer Engineering &
Technology (IJCET), Volume 5, Issue 1, 2014, pp. 68 - 84, ISSN Print: 0976 6367,
ISSN Online: 0976 6375.
[19] Mahmoud M. Maqableh, Secure Hash Functions Based on Chaotic Maps for E-Commerce
Applications, International Journal of Information Technology and Management
Information Systems (IJITMIS), Volume 1, Issue 1, 2010, pp. 12 - 22, ISSN Print:
0976 6405, ISSN Online: 0976 6413.