The performance result is introduced with complex chaotic six keys with the EL-CKP method. The performance result is applied in Conversion/Encryption Time and Avalanche Effects. The analysis result environment is performed by using Intel® Core(TM) i3-6006U CPU @ 2.GHz processor speed with x64- based processor, 4 GB RAM.
4.1 Key Sensitivity Analysis
The chaotic keys are too complex to search or calculate according to the chaotic terms. The chaotic keys are explored hard noticeable parts in the key parameters (Ckk+1 ∈ {A, Ckk }):
Ckk+1= A × Ckk(Ckk− 1); If (Ckk> 255) then Ckk= Ckkmod 256;
Original Data:– “MM Kalam Sahab”. Key Parameters {A, Ckk} with Keys {Ck1, Ck 2………….. Ckq} and key values A = chaotic value ;
4.1.1 Sensitivity of Calculated Condition Ckk
It is analyzed that if any one minor changes are transforming in the given condition Ckk like several numbers then the encrypted data are entirely transformed into a different form for the original data. All the transformation for Ckk by changing a little bit of text to calculate different encrypted values is displayed in Table 1.
Table 1
Sensitivity of Calculated Condition Ckk
Ckk
|
A
|
Ckk+1
|
Chaotic Keys (Ckk+1 )
|
Encrypted Value
|
6
|
3
|
90,222,242,118,202,206
|
90,222,242,118,202,206,90,
222,242,118,202,206,90,222
|
““_°&/¶>_¨&+¶1
|
7
|
3
|
126,146,22,106,110,130
|
126,146,22,106,110,130,126,
146,22,106,110,130,126,146
|
¾R»¬“c“r»´“g“}
|
8
|
3
|
168,200,104,136,40,72
|
168,200,104,136,40,72,168,
200,104,136,40,72,168,200
|
ÅNÄ©D(ÅVÄD'
|
9
|
3
|
216,56,24,120,88,184
|
216,56,24,120,88,184,216,
56,24,120,88,184,216,56
|
øµ¾´Y4ص¦´]4×
|
10
|
3
|
14,34,38,122,254,18
|
14,34,38,122,254,18,14,
34,38,122,254,18,14,34
|
Î⋼ó⋤÷âÍ
|
11
|
3
|
74,78,98,102,186,62
|
74,78,98,102,186,62,74,
78,98,102,186,62,74,78
|
““Ï Vߦ®Ï¸VÛ¦¡
|
4.1.2 Sensitivity of Initial Condition A
The sensitivity of initial condition A for the initial number is analyzed in Table 2. By using little changes in A initial condition then these modifications generate full changes in encrypted data. The given All the used changes can make different encryption and decryption output. So the sensitivity of the A initial condition is accepted without change in the process of key calculation, encryption, and decryption process.
Table 2
Sensitivity of Initial Condition A
Ckk
|
A
|
Ckk+1
|
Chaotic Keys (Ckk+1 )
|
Encrypted Value
|
6
|
1
|
30,102,62,198,94,38
|
30,102,62,198,94,38, 30,
102,62,198,94,38,30,102
|
|1¢eP$1ºaP+
|
6
|
2
|
60,168,48,160,192,128
|
60,168,48,160,192,128,60,
168,48,160,192,128,60,168
|
/»Nµÿ²›Nÿ¶”
|
6
|
3
|
90,222,242,118,202,206
|
90,222,242,118,202,206,90,
222,242,118,202,206,90,222
|
““_°&/¶>_¨&+¶1
|
6
|
4
|
120,32,128,0,0,0
|
120,32,128,0,0,0,120,
32,128,0,0,0,120,32
|
“Ñ“÷ÝÐ¥ñ“ïÝÔ¥þ
|
6
|
5
|
150,134,22,6,150,134
|
150,134,22,6,150,134,150,
134,22,6,150,134,150,134
|
0 ݦ““ ݾ““
|
6
|
6
|
180,40,144,160,64,128
|
180,40,144,160,64,128,180,
40,144,160,64,128,180,40
|
ǣſƪDZĻǶǏşƪǩĻDzǏŐ
|
4.2 Cryptanalysis Result
The security scheme can prove the security features of the method with the help of cryptanalysis protocols. The cryptanalysis protocols are analyzed by breaking the secret code of the organized scheme and uncovering the used possible encryption keys and original data as well.
4.2.1 Secret Data Only Attack
Parameters: q = 6, A = 3, Ckk = 6, Con = 31.
Chaotic Keys: Ckk+1 {90, 222, 242,118, 202, 206}.
Given: Encryption Phases: EP1, EP2:- Ecy1 = ECk(UD1), Ecy2 = ECk 2(UD2),…………, Ecyi= ECk q(UDi) where q = 1 to 6, EKq = EP1, EP2(Ckq) .
Deduce:- Either UD1, UD2, UD3, UD4,………………… UDi.
Ck 1, Ck 2 , Ck3, Ck4, Ck5, Ck6.
Example
UD1 = C then
|
Ecy 1 = E Ck 1(UD1) = E90
|
C = D
|
UD 2 = CC then
|
Ecy 2 = E Ck 1,2(UD2) = E90, 222
|
CC = DÀ
|
UD 3 = CCC then
|
Ecy 3 = E Ck 1,2,3(UD3) = E90, 222, 242
|
CCC = DÀì
|
UD 4 = CCCC then
|
Ecy 4 = E Ck 1,2,3,4(UD4) = E90, 222, 242, 118
|
CCCC = DÀìh
|
UD 5 = CCCCC then
|
Ecy 5 = E Ck 1,2,3,4,5(UD5) = E90, 222, 242, 118, 202
|
CCCCC = DÀìhÔ
|
UD 6 = CCCCCC then
|
Ecy 6 = E Ck 1,2,3,4,5,6(UD6) = E90, 222, 242, 118, 202, 206
|
CCCCCC = DÀìhÔÐ
|
The presented result is explaining that if any value of data is repeated one or more times in the original data, the encrypted data is changed in a different form for the repeated data C. The Encrypted data of text C resulting as the 1st text value is unrelated to C resulting in N time text value in the original data.
4.2.2 Known Plain Data Attack
Parameters: q = 6, A = 3, Ckk = 6, Con = 31.
Chaotic Keys: Ckk+1 {90, 222, 242,118, 202, 206}.
Given: Encryption Phases: EP1, EP2: UD1, Ecy1 = ECk1 (UD1), UD2, Ecy2 = ECk2 (UD2),…………, UDi, Ecyi = ECkq (UDi) where q = 1 to 6, ECkq = EP1, EP2 (Ckq).
Deduce:- Either Ck1, Ck2, Ck3, Ck4, Ck5, Ck6.
Example
UD 1 = I then
|
Ecy 1 = E Ck 1(UD1) = E90
|
I = N
|
UD 2 = II then
|
Ecy 2 = E Ck 1,2(UD2) = E90, 222
|
II = NÊ
|
UD 3 = III then
|
Ecy 3 = E Ck 1,2,3(UD3) = E90, 222, 242
|
III = NÊæ
|
UD 4 = IIII then
|
Ecy 4 = E Ck 1,2,3,4(UD4) = E90, 222, 242, 118
|
IIII = NÊæb
|
UD 5 = IIIII then
|
Ecy 5 = E Ck 1,2,3,4,5(UD5) = E90, 222, 242, 118, 202
|
IIIII = NÊæbÞ
|
UD 6 = IIIIII then
|
Ecy 6 = E Ck 1,2,3,4,5,6(UD6) = E90, 222, 242, 118, 202, 206
|
IIIIII = NÊæbÞÚ
|
The analyzed result of the given example is shown many repeated data values with their related encrypted data. It is made too complex for breaking the key or the security scheme which is added for the encryption phase of the original data value for decryption. The calculated complex keys are produced in rare complex terms and strong barriers. The encrypted data of user data value I set up as the 1st data value is unrelated data value text I set up as the N time data value in the original data.
4.2.3 Chosen Plaindata Attack
Parameters: q = 6, A = 3, Ckk = 6, Con = 31.
Chaotic Keys: Ckk+1 {90, 222, 242,118, 202, 206}.
Given: Encryption Phases: EP1, EP2: UD1, Ecy1 = ECk1 (UD1), UD2, Ecy2 = ECk2 (UD2),…………, UDi, Ecyi = ECkq (UDi) where q = 1 to 6, ECkq = EP1, EP2 (Ckq).
Where the cryptanalysis obtain to determine UD1, UD2, UD3,…. UDq; and q = 1 to 6.
Deduce Either UD1, UD2, UD3,…........ UDq;
Example
UD 1 = OP then Encrypted data Ecy1 = ECk1,2 (UD1) = E16,20 (OP) = HÓ
UD 2 = PO then Encrypted data Ecy2 = ECk1,2 (UD2) = E16,20 (PO) = WÌ
It is made too complex a security scheme to decrypt the encrypted secret data. That is encrypted with similar keys, so finding keys is making too complex.
4.2.4 Chosen Secret Data Attack
Parameters: q = 6, A = 3, Ckk = 6, Con = 31.
Chaotic Keys: Ckk+1 {90, 222, 242,118, 202, 206}.
Given: Two step Encryption EP1, EP2:- Ecy1, UD1 = DCk1 (Ecy1, Ecy2, UD2 = DCk2(Ecy2),,…………, Ecyq, UDq = DCkq (Ecyq), where q = 1 to 6, DCkq = DP1, DP2(Ckq)
Deduce Either Ck1, Ck2, .................... Ckq.
Example
Ecy 1 = HÓ then Encrypted Data UD1 = DCk1,2 (Ecy1) = D16,20 (HÓ) = OP
Ecy 2 = WÌ then Encrypted Data UD2 = DCk1,2(Ecy2) = D16,20 (WÌ) = PO
The chaotic keys are calculated with given parameters A, and Ckk+1. The given keys are too sensitive and different to each parameter, so this concept is making complicated to deduce the keys by transforming the encrypted data and its decrypted original data.
4.3 Analysis for EL-CKP
The security method as an Efficient and Lightweight Chaotic function with Key Exchange Protection (EL-CKP) is measured with some existing security methods. The performance result is tested by speed and the avalanche effect. The EL-CKP is situated to make a very strong shield to cover sensitive data. The presented result is gratified with the given existing terms of security features by experimental result.
4.3.1 Conversion/Encryption Time
The conversion/encryption time of the EL-CKP method is located on the computation time. That is performed the key length, the complication of the EL-CKP security method, and the plain data size to be encrypted with different patterned encryption protocols. The result is given with different sizes of data files 6kb to 30kb in 8 different sizes of data files and conversion/encryption time collected linearly from small to big size of data files.
4.3.2 Protocol of Avalanche Effect
The Avalanche protocol is identified in [16] [17] [20] and resulted to make strong conversion of data at least 50% in the security scheme. The avalanche effect of the EL-CKP security method is the result of using the method:
A f = (changed total bits / present total bits in converted data)×100%;
Where the changed total bits = count the total number of bits converted; present total bits in converted data = count total bits in encrypted data:
The protocol of the avalanche effect is calculated by using XOR bit-wise operation between the encrypted data and the changed one-bit encrypted data. The bit-wise XOR operator can be helpful to count the number of 1’s bit.
4.3.3 The Avalanche Effect by Given Minor Data
The Minor data “MM Kalam Sahab” with their decimal values “77, 77, 32, 75, 97, 108, 97, 109, 32, 83, 97, 104, 97, 98” is engaged to calculate the result of avalanche effect with similar six keys “90, 222, 242, 118, 202, 206” for both minor data distorted a one single bit value “MM Kalam SahaB” with their decimal values “77, 77, 32, 75, 97, 108, 97, 109, 32, 83, 97, 104, 97, 66”. Both minor data are converted with the same keys at both times.
Table 3
The Result of the avalanche effect by giving minor data after distorting a single bit of data value
Protocol
|
Ckk+1
|
UD n
|
UD n In decimal
|
Ecyi in decimal
|
Avalanche Effect
|
EL-CKP
|
90,
222,
242,
118,
202,
206
|
MM Kalam Sahab
|
77,77,32,75,97,
108,97,109,32,
83,97,104,97,98
|
74,206,143,96,246,255,102,238,143,120,
246,251,102,225
|
69/112 =
61.60%
|
MM Kalam SahaB
|
77,77,32,75,97,
108,97,109,32,
83,97,104,97,66
|
119,243,178,93,203,
194,91,211,178,69,
203,198,91,252
|
The result of the avalanche protocol for the EL-CKP security method is shown in Table 3. The analyzed result of the avalanche effect after shifting one single bit in the minor data value is calculated at 61.60%. That is a achieving good avalanche effect of the organized security method to make a guarantee to generate dissimilar encrypted data if any modifications are performed in the original data then the conversion of data must be dissimilar.
4.3.4 The Avalanche Effect with different files by flipping one bit
The plain data file is added with data “MM Kalam Sahab” with their decimal values “77, 77, 32, 75, 97, 108, 97, 109, 32, 83, 97, 104, 97, 98” and their binary form “01001101 01001101 00100000 01001011 01100001 01101100 01100001 01101101 00100000 01010011 01100001 01101000 01100001 01100010” is engaged to calculate the result of avalanche effect with similar keys “90, 222, 242, 118, 202, 206” and their binary form “01111000 10001111 10010111 11110000 0011010 01011010” for distorted one single bit in diverse 11 data files. All the diverse one-bit of data files are produced with similar keys to convert encrypted data.
The analyzed result is displayed in Fig. 3 graphically to make the better avalanche effect by using similar keys in all 11 diverse data files. The security method is getting results above 50% by diverting a single bit of data files. The realized result is generating high-level security features for protecting data with better results of the EL-CKP security method to protect against unwanted users and man-in-the-middle attacks also.