See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/45534483

Efficient Chaotic Permutations for Image Encryption Algorithms

Article · June 2010

Source: DOAJ

CITATIONS READS

13 192

2 authors:

Abir Awad Hakim Saadane

Irish centre for cloud computing and commerce Polytech Nantes
28 PUBLICATIONS 445 CITATIONS 80 PUBLICATIONS 403 CITATIONS

SEE PROFILE SEE PROFILE

All content following this page was uploaded by Hakim Saadane on 15 January 2014.

The user has requested enhancement of the downloaded file.

Efficient Chaotic Permutations for Image
Encryption Algorithms

Abir AWAD, Abdelhakim Saadane

[email protected]

1
 Outlines of presentation

1. Introduction
2. Chaotic maps
3. Chaotic permutation methods
4. Conclusions and perspectives

2
 Outlines of presentation

1. Introduction
2. Chaotic maps
3. Chaotic permutation methods
4. Conclusions and perspectives

3
Introduction

Introduction
Eve

Attack

Alice Bob

Transmission Channel
Encryption Decryption
original data Encrypted data Encrypted data Decrypted data

Hello %j$klnr %j$klnr Hello

4
Introduction
Encryption chaotic algorithm:
Descriptive Diagram
Chaotic map

Substitution

Clear information
Permutation

SP box

Encryption algorithm

Encrypted information 5
 Outlines of presentation
1. Introduction
2. Chaotic maps
 Chaotic signal
 PWLCM chaotic map
 Finite Precision effect
 Proposed perturbation technique
3. Chaotic permutation methods
5. Conclusions and perspectives

6
Chaotic maps

Chaotic signal
pwlcm perturbé autocorrelation
1

0.9
0.8
0.8

0.7
0.6
0.6

0.5 0.4

0.4
0.2
0.3

0.2
0
0.1

0 -0.2
0 100 200 300 400 500 600 700 800 900 1000 -8 -6 -4 -2 0 2 4 6 8
4
x 10

Chaotic signal is a signal like noise

Sensitive to initial conditions

7
Chaotic maps

PWLCM chaotic map

• A piecewise linear chaotic map (PWLCM) is a map composed of

multiple linear segments. 1

x  n   F [ x  n  1]
0.9

0.8

 1
  if 0  x  n  1  p
0.7

 x n  1  0.6

 p
0.5
 1
  x  n  1  p   if p  x  n  1  0.5 0.4

 0.5  p 0.3

 F [1  x  n  1] if 0.5  x  n  1  1
0.2

 0.1
 0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

• where the positive control parameter p є (0; 0.5) and x(i) є (0; 1).
8
Chaotic maps

Finite Precision effect

Finite precision => Finite cycle length
xl 1

x1 x2 xl

xl  n

Transient branch cycle

perturbation
The perturbation
increase the chaotic x(n  1) Chaotic x(n)
cycle length map

9
Chaotic maps

Proposed perturbation technique

x(n  1)  0.x1 (n  1) x2 (n  1)...xN k (n  1) xN k 1 (n  1)...xN (n  1)

Qk 1 (n)Qk 2 (n)...Q1 (n)Q0 (n)

F ( x(n 1))  0.F ( x1 (n 1))F ( x2 (n 1))...F ( xN k (n 1))F ( xN k 1 (n 1))...F ( xN (n 1))

Minimal cycle length: 

Tmin    2k  1 
10
 Outlines of presentation
1. Introduction
2. Chaotic maps
3. Chaotic permutation methods
 Chaotic permutation -GRP
 Chaotic permutation- CROSS
 Socek permutation
 Permutation results
5. Conclusions and perspectives

11
Chaotic permutation methods

Chaotic bit permutation methods

Bit permutation methods controlled by chaotic values

R1= [ b1, b2, b3, b4, b5, b6, b7, b8]

Permutation

R3= [ b4, b6, b7, b1, b3, b8, b2, b5]

Inverse
permutation

R1 = [ b1, b2, b3, b4, b5, b6, b7, b8]

12
Chaotic permutation methods

Chaotic permutation -GRP

R3 = GRP (R1, R2)

R2: Control bits 1 0 0 1 1 0 1 0

R1: Original bits

a b c d e f g h

R3: Permuted bits b c f h a d e g

13
Chaotic permutation methods

Chaotic permutation - CROSS

R3 =CROSS (m1, m2, R1, R2)
R2: Control 1 0 0 1 1 0 1 0
bits

R1: Original a b c d e f g h
bits

0 0 - - - -
m1=2 1 1

e b c h a f g d

m2=1 1
0 - -
1
0 - -

R3: Permuted
c b e h g f a d 14
bits
Chaotic permutation methods

Socek Permutation
R3= Socek (x, R1)
x: chaotic value (control)
Indices of R1 bits
(to permute) 1 2 3 4 5 6 7 8

Permuted 4 6 7 1 3 8 2 5
Indices

15
Chaotic permutation methods

Permutation Results

Original image
16
Chaotic permutation methods

Difference between the original and

the permuted images
PWLCM Perturbed PWLCM

Grp Cross Socek Grp Cross Socek

NPCR 79.508 87.655 99.569 76.984 80.992 98.520

UACI 19.176 21.685 29.106 18.216 20.025 27.139

M 1 N 1

1
D(i, j )  
if P1 (i, j )  C1 (i, j )  D(i, j)
i 0 j 0
NPCR   100
0 else M N
17
Chaotic permutation methods

Difference between the original and

the permuted images
PWLCM Perturbed PWLCM

Grp Cross Socek Grp Cross Socek

NPCR 79.508 87.655 99.569 76.984 80.992 98.520

UACI 19.176 21.685 29.106 18.216 20.025 27.139

M 1 N 1
P1 (i, j )  C1 (i, j )

1
UACI  x100
MxN i 0 j 0
255

18
Chaotic permutation methods

Correlation coefficients of intra color

- components
Permuted image using
Permuted image using
Mandrill perturbed PWLCM to
Correlation PWLCM to control
image control
Grp Cross Socek Grp Cross Socek
Red (R)
component 0.1911 0.0717 0.0259 0.0171 0.0458 0.0243 0.0155
Correlation
Green (G)
component 0.0883 0.0308 0.0120 0.0066 0.0164 0.0110 0.0055
Correlation
Blue (B)
component 0.0948 0.0572 0.0196 0.0152 0.0356 0.0178 0.0138
Correlation
Mean value 0,1247 0.0532 19
0.0192 0.0130 0.0326 0.0177 0.0116
Chaotic permutation methods

Correlation coefficients of inter -

color - components
Permuted image using
Mandrill Permuted image using perturbed PWLCM to
Correlation PWLCM to control control
image
Grp Cross Socek Grp Cross Socek
Correlation
between 0.3565 0.2776 0.1925 0.1280 0.1621 0.1147 0.0703
R and G
Correlation
between 0.8074 0.3722 0.2453 0.0684 0.2490 0.1893 0.0591
G and B
Correlation
between 0.1237 0.0571 0.0491 0.0161 0.0506 0.0484 0.0088
B and R 20
Chaotic permutation methods

Distribution of two (vertically )

adjacent pixels
Original image 300
Cross + PWLCM 300
Cross + perturbed map
300

250 250
250

200 200
200

150 150
150

100 100 100

50 50 50

0 0 0
0 50 100 150 200 250 300 0 50 100 150 200 250 300 0 50 100 150 200 250 300

300 300

250 250

200 Socek
Socek 200

+
+ 150 150

perturbed
PWLCM 100 100

50 50
map
0
0 50 100 150 200 250 300
0 21
0 50 100 150 200 250 300
Chaotic permutation methods

Histogram analysis
Original image Grp + PWLCM Grp + perturbed map
2000 2000
2000

1800 1800 1800

1600 1600 1600

1400 1400 1400

1200 1200 1200

1000 1000 1000

800 800 800

600 600 600

400 400 400

200 200 200

0 0 0
-50 0 50 100 150 200 250 300 -50 0 50 100 150 200 250 300 -50 0 50 100 150 200 250 300

2000 2000

1800 1800

1600 1600

Socek
Socek 1400 1400

1200
1200
+
+ 1000
1000

800
800
perturbed
PWLCM 600
600

400
400 map
200
200
0 22
0 -50 0 50 100 150 200 250 300
-50 0 50 100 150 200 250 300
Chaotic permutation methods

Information entropy analysis

Permuted image using

Mandrill Permuted image using perturbed PWLCM to
Correlation PWLCM to control control
image
Grp Cross Socek Grp Cross Socek

Entropy 7.762 7.862 7.881 7.888 7.906 7.913 7.950

2 N 1


1
H  m  p  mi  log 2
i 0
p  mi 
23
 Outlines of presentation

1. Introduction
2. Chaotic maps
3. Chaotic permutation methods
4. Conclusions and perspectives

24
 Conclusions
Novel chaotic permutation technique

Comparative study of three bit permutation methods

The proposed permutation technique is more secure and

suitable for chaotic image encryption schemes

This study allows choosing an efficient permutation

method to construct a chaotic cryptosystem with
good cryptographic properties
25
 perspectives

Novel chaotic encryption method using this permutation

technique.

The measure of the impact of this permutation method

of the hole encryption algorithm.

Comparative study of the choosing bit permutation

method and the S box of the AES encryption method.

26
 Thank you

27
View publication stats