1. PERFORMANCE EVALUVATION OF
CHAOTIC ENCRYPTION
GUIDE: PROF JOHN SINGH
SITE
ANCY MARIAM BABU
10MCA0010

2. OBJECTIVES
 The main objectives are:
 To analyze the confidentiality, integrity of the
transmitting video data
 To analyze the efficiency of each chaotic algorithm
 To observe the encryption speed , power consumption
and CPU utilization of the system.

3. INTRODUCTION
 What is cryptography?
 The objectives of cryptography
 What is chaos?
 Chaotic cryptography
 Chaotic encryption
 Chaotic decryption

4. CRYPTOGRAPHY
 Cryptography is science of
secure information.
 Components:
 Encryption
 Decryption
 Objectives:
 Confidentiality
 Authentication
 Integrity

5. CHAOS
 The term ‘CHAOS’ defined: the state of
randomness or confusion.
 Chaos theory
 A field of study in mathematics
 Study the behavior of dynamic systems
with initial condition

6. CHAOTIC CRYPTIGRAPHY-
HISTORY
 IN 1950, SHANNON MENTIONED CHAOS
CAN USEDD FOR CRYPTOGRAPHY
 AT 1980, SHANNON DEVELOPED
CHAOTIC THEORY
 1N 1990, FIRST CHAOTIC BASED CIPHER
 1N 1998, CHAOTIC ENCRYPTON
DEVELOPED BY BAPTISTA
 IN 2000, CHAOS STARTED TO USE
WIDELY

7. CHAOTIC CRYPTOGRAPHY
 Type of fast and secure cryptographic method
 Usually chaotic signals are noisy like and
chaotic systems are initially sensitive.
 Substantial reduction in encryption and
decryption time.
 Components
 Chaotic encryption and decryption

8. CHAOTIC ENCRYPTION
 Known as Baptista's method .
 Encryption process
 Define mapping scheme of trajectory
 Choose initial condition and parameter key
 Set initial condition as current trajectory
 Iterate the chaotic equation until the trajectory
reaches the destination site for each symbol.
 Store the number of iterations as a cipher
 Encrypt the next message with current
trajectory
 Produce cipher and repeat the process

9. CHAOTIC DECRYPTION
 Decryption process
 Set the initial condition and parameters and apply the
same mapping scheme for decryption.
 Iterate the chaotic equation by the cipher (number of
iterations).
 Find out the site that the trajectory belonged to and
store the symbol of the site as message symbol.
 Decrypts next symbol by iterating the current trajectory
and producing the next message symbol and so on.

10. EXISTING METHODS
 Selected algorithms are
 CVES
 SEA
 NCA
 EES

11. ALGORITHMS
 CVEA
 Proposed by Shu Jun Lia, Xuan Zhengb, Xuanqin Moua and
Yuanlong Caia
 Universal hasty encryption scheme
 Method: encrypt the video using plain cluster
 The encryption procedure: one plain-cluster is encrypted by
stream sub cipher and followed by block sub cipher.
 Decryption: the encrypted plain-cluster is firstly decrypted
by block sub-cipher
 Pre decrypted plain cluster is encrypted by stream sub
cipher.

12. ALGORITHMS
 SEA
 Low cast targeted encryption
 Operates on several word sizes, texts and key
 Based on Feistel theory with random round of
varying numbers.
 NCA
 Use power function and the tangent function
 Proposed by Hogan Gao, Yisheng Zhang, Shuyun
Liang, Dequn Li.
 Two parts of analysis:
 Logistic map analysis
 NCA map design

13. ALGORITHM
 EES
 Approved by U.S department of commerce in
1994.
 Considerable feature is a key escrowed method
enabling for detecting attacker
 Symmetric key encryption method
 Both SKIPJACK and LEAF creation methods are
used for the encryption or decryption.

14. RESULTS AND DISCUSSION
 Performance analysis of selected chaotic
encryption technique
 Parameters used:
 Encryption speed
 CPU utilization
 Power consumption
 Tool used:
 CPU meter
 Encryption –decryption tools
 Laptop with IV CPU 2.4GHz

15. PARAMETERS
 ENCRYPTION SPEED:
 Throughput of the encryption indicate speed of
encryption.
 CPU utilization:
 CPU utilization means the CPU processing time.
 It indicates the load on the CPU
 Power consumption:
 CPU cycle measurement.
 Depends on the load on CPU

16. ENCRYPTION SPEED
45
comparison of different encryption in
terms of encryption time and packet
40 size:
35
CVES
30
25
SEA
20
15
NCA
10
5
EES
0
THROUGHPUT

17. POWER CONSUMPTION
2000
1800
1600
1400 comparison of different encryption in terms of
encryption time and packet size:
1200 CVES
1000 SEA
800 NCA
600 EES
400
200
0
49 100 247 694 963 3341.19 5310.88

18. TOOLS
 CPU meter  Encryption decryption
tool

19. Snapshots of encryption
 USING CERTAIN TOOLS FOR
ENCRYPTION

20. SNAPSHOTS FOR ENCRYPTED DATA

21. CONCLUSION
 Chaotic cryptography provides higher security
and efficiency to resist the attack.
 CVES and NCA – better encryption speed
 EES needs more time to encrypt
 All the algorithm ranges security from high to
middle level.

22. REFFEERENCE
 Gary C. Kessler 1998, An overview of cryptography, Auerbach
(September 1998) pp 3-4.
 Jon Collas 2009, introduction to cryptography, pgp
cooperation pp7-29
 Deckert Florian , 23 march 2007, A brief history of
cryptography, slide share.net 1 April 2010
 J Wei, X Liao, K Wong, T Xiang 2006, A new chaotic
cryptosystem, chaos Solutions & Fractals – Elsevier pp 4-10
 M.K.HO (Archon) 2001 chaotic encryption standard-
history, chaotic encryption webmaster
 Stephen R. Addison, John E. Gray 2006 Chaos and encryption:
problems and potential , IEEE 2006 , pp 275

23. REFFERENCE
 T Yang 2004, A Survey of chaotic secure communication
system , international journal of computational
cognitive, yangsky.com
 Shujun Li, Xuan Zheng, Xuanqin Mou and Yuanlong Cai
February 2002, chaotic encryption scheme for real time
digital video, electronic imaging 2002, vol: 4666, pp149-
160
 Yaobin Mao and Guanrong Chen, chaos based image
encryption, 725 publications/journal pp8-20
 G. Alvartz and Shujun Li, 2009, Crypt analyzing a
nonlinear chaotic algorithm(NCA) for image
encryption, communication in nonlinear science and
numerical simulations vol:14 pp 3743-3759