Beamer Demo

Digital Image Scrambling Using Cellular Automata
Ajith K.P.-B100189EC Arun Tony-B100171EC Aswin E Augustine-B100305EC Basil Babu-B100523EC Vaisakh R.P. -B100087EC
National Institute of Technology
November 12th 2013
Major Project
Image Encryption
1/24
Introduction
Need for Scrambling
Major Project
Image Encryption
2/24
Introduction
Need for Scrambling security reasons
Major Project
Image Encryption
2/24
Introduction
Need for Scrambling security reasons Areas of Application
Major Project
Image Encryption
2/24
Introduction
Need for Scrambling security reasons Areas of Application condential remote video conferencing
Major Project
Image Encryption
2/24
Introduction
Need for Scrambling security reasons Areas of Application condential remote video conferencing security communication
Major Project
Image Encryption
2/24
Introduction
Need for Scrambling security reasons Areas of Application condential remote video conferencing security communication military applications
Major Project
Image Encryption
2/24
Introduction
Image Scrambling methods

Advanced Encryption Standard
Major Project
Image Encryption
3/24
Introduction

Advanced Encryption Standard Magic Cube
Major Project
Image Encryption
3/24
Introduction

Advanced Encryption Standard Magic Cube Arnolds Cat Map
Major Project
Image Encryption
3/24
Introduction

Advanced Encryption Standard Magic Cube Arnolds Cat Map Twice Internal Division
Major Project
Image Encryption
3/24
Introduction

Advanced Encryption Standard Magic Cube Arnolds Cat Map Twice Internal Division Cellular Automaton
Major Project
Image Encryption
3/24
Cellular Automata
Introduced by Ulam and von Neumann in 1940
Major Project
Image Encryption
4/24
Cellular Automata
Introduced by Ulam and von Neumann in 1940 Consist of rectangular grid of identical cells
Major Project
Image Encryption
4/24
Cellular Automata
Introduced by Ulam and von Neumann in 1940 Consist of rectangular grid of identical cells Each cell takes nite number of states
Major Project
Image Encryption
4/24
Cellular Automata
Introduced by Ulam and von Neumann in 1940 Consist of rectangular grid of identical cells Each cell takes nite number of states At each step cells update synchronously by applying
rules(transition functions)
Major Project
Image Encryption
4/24
Cellular Automata
Introduced by Ulam and von Neumann in 1940 Consist of rectangular grid of identical cells Each cell takes nite number of states At each step cells update synchronously by applying
rules(transition functions)
These rules are based on the states of the respective cells
and their neighbours
Major Project
Image Encryption
4/24
Cellular Automata
Related Automata variation in cells
Major Project
Image Encryption
5/24
Cellular Automata

hexagonal cells
Major Project
Image Encryption
5/24
Cellular Automata

hexagonal cells irregular cells
Major Project
Image Encryption
5/24
Cellular Automata

probabilistic rules instead of deterministic
Major Project
Image Encryption
5/24
Cellular Automata

probabilistic rules instead of deterministic .001% probability that each cell will transition to opposite colour
Major Project
Image Encryption
5/24
Cellular Automata

probabilistic rules instead of deterministic .001% probability that each cell will transition to opposite colour continuous automata
Major Project
Image Encryption
5/24
Cellular Automata
Cellular Automata Neighbourhood 1D CA
Major Project
Image Encryption
6/24
Cellular Automata

Each cell and its immediate left and right neighbours
Major Project
Image Encryption
6/24
Cellular Automata

Each cell and its immediate left and right neighbours 2D CA
Major Project
Image Encryption
6/24
Cellular Automata

Each cell and its immediate left and right neighbours 2D CA Von Neumann Neighbourhood
Major Project
Image Encryption
6/24
Cellular Automata

Each cell and its immediate left and right neighbours 2D CA Von Neumann Neighbourhood Moore Neighbourhood
Conways Game of Life uses the Moore Neighbourhood
Major Project
Image Encryption
6/24
Von Neumann Neghbourhood
dened by
N H (x0 , y0 , r) = [(x, y ) : x x0 + y y0 r]
number of cells in each neighbourhood
n = 2r(r + 1) + 1
if r=1 , then n= 5
Major Project
Image Encryption
7/24
Von Neumann Neighbourhood
Major Project
Image Encryption
8/24
Moore Neighbourhood
dened by
N H (x0 , y0 , r) = [(x, y ) : x x0 r, y y0 r]
number of cells in each neighbourhood
n = (2r + 1)2
if r=1 , then n= 9
Major Project
Image Encryption
9/24
Moore Neighbourhood
Major Project
Image Encryption
10/24
Boundary Conditions
To determine neighbours of cells at the edges periodic

1D - rows turned into circles 2D - rectangular grids turned into toroids
static extreme cells are connected to permanent zero state cells
Major Project
Image Encryption
11/24
Conways Game of Life
consists of [M X N] matrix of cells with two states alive or
dead
uses Moore neighbourhood at every generation each cell compute its new state using
transition rules
every cell are updated simultaneously(synchronous)
Major Project
Image Encryption
12/24
Conways Game of Life

The Transition Rules
Birth - A dead cell becomes alive if exactly three
neighbours were alive

Death by Overcrowding - An alive cell dies if more than
three of its neighbours were alive

Death by Exposure - An alive cell dies if one or none of its

Survival - An alive cell remains alive if two or three of its
Major Project
Image Encryption
13/24
Procedure
Encoding
Image le is read in as a matrix An initial random conguration is set up for game of life
algorithm
Read the positions of the alive cells Take the grey value of rst pixel and put it in the position of
the rst alive cell

Take the next value and continue likewise Continue like this for the required generations If an alive cell has already appeared before, then discard it After the last generation, ll the scrambled image with the
remaining pixel
Major Project
Image Encryption
14/24
Figure: Image Scrambling Using First Generation

Major Project Image Encryption 15/24
Procedure
Decoding In decoding we know the initial conguration and the number of generations and we can execute the inverse of the scrambling algorithm to obtain the original image.
Major Project
Image Encryption
16/24
Analysis
Grey Difference,
GD(i, j ) =
1 4
[P (i, j ) P (i , j )]2
i,j
Average Neighbourhood Grey Differernce,
E [GD(i, j )] =
Grey Value Degree,
M 1 i=2
N 1 j =2 GD (i, j )
(M 2)X (N 2)
GDD =
E (GD(i, j )) E (GD(i, j )) E (GD(i, j )) + E (GD(i, j ))
Better scrambling correspondes to an absolute value near one

Major Project Image Encryption 17/24
Observations
Figure: original image of a rino
Figure: scrambled image of the rino
Major Project
Image Encryption
18/24
Observations
Figure: original image of a boat
Figure: scrambled image of the boat
Major Project
Image Encryption
19/24
Observations
Figure: original image of lena
Figure: scrambled image of lena
Major Project
Image Encryption
20/24
Observations
Figure: original image of letterP
Figure: scrambled image of the letterP
Major Project
Image Encryption
21/24
Observations
no. of generations 1 5 20 100
lena 0.9979 0.9983 0.9989 0.9984
boat 0.7128 0.4618 0.6801 0.8446
rino 0.9847 0.9938 0.9991 0.9987
letter P 1.0000 1.0000 1.0000 1.0000
Table: GDD
Major Project
Image Encryption
22/24
Figure: resolution of 50 X 50
Figure: GDD value vs no. of generations
Major Project
Image Encryption
23/24
Conclusion
Attacker cannot break the encrypted image even if the
algorithm is open
We can provide high security by using double scrambling Due to diffusion process rate of encryption and decryption
increases
Major Project
Image Encryption
24/24

Beamer Demo

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Beamer Demo

Enviado por

Direitos autorais:

Formatos disponíveis

Digital Image Scrambling Using Cellular Automata

November 12th 2013

Need for Scrambling

Need for Scrambling security reasons

Need for Scrambling security reasons Areas of Application

Image Scrambling methods

Image Scrambling methods

Image Scrambling methods

Image Scrambling methods

Image Scrambling methods

Introduced by Ulam and von Neumann in 1940

and their neighbours

Related Automata variation in cells

Related Automata variation in cells

Related Automata variation in cells

Related Automata variation in cells

probabilistic rules instead of deterministic

Related Automata variation in cells

Related Automata variation in cells

Cellular Automata Neighbourhood 1D CA

Cellular Automata Neighbourhood 1D CA

Cellular Automata Neighbourhood 1D CA

Cellular Automata Neighbourhood 1D CA

Cellular Automata Neighbourhood 1D CA

Conways Game of Life uses the Moore Neighbourhood

Von Neumann Neghbourhood

Von Neumann Neighbourhood

To determine neighbours of cells at the edges periodic

static extreme cells are connected to permanent zero state cells

Conways Game of Life

consists of [M X N] matrix of cells with two states alive or

Conways Game of Life

neighbours were alive

three of its neighbours were alive

neighbours were alive

neighbours were alive

the rst alive cell

Figure: Image Scrambling Using First Generation

Average Neighbourhood Grey Differernce,

E (GD(i, j )) E (GD(i, j )) E (GD(i, j )) + E (GD(i, j ))

Better scrambling correspondes to an absolute value near one

Figure: original image of a rino

Figure: scrambled image of the rino

Figure: original image of a boat

Figure: scrambled image of the boat

Figure: original image of lena

Figure: scrambled image of lena

Figure: original image of letterP

Figure: scrambled image of the letterP

no. of generations 1 5 20 100

lena 0.9979 0.9983 0.9989 0.9984

boat 0.7128 0.4618 0.6801 0.8446

rino 0.9847 0.9938 0.9991 0.9987

letter P 1.0000 1.0000 1.0000 1.0000

Figure: GDD value vs no. of generations

Attacker cannot break the encrypted image even if the

Você também pode gostar