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

net/publication/342412775

A New Method of Data Encryption based on One to One Functions

Article in International Journal on Advanced Science Engineering and Information Technology · June 2020
DOI: 10.18517/ijaseit.10.3.10765

CITATIONS READS

2 402

5 authors, including:

Osama Shahin Anis Ben Aissa

Al-Jouf University Tunis El Manar University
38 PUBLICATIONS 387 CITATIONS 34 PUBLICATIONS 570 CITATIONS

SEE PROFILE SEE PROFILE

Yaser Fouad Hassan Al-Mahdi

Suez univeristy Suez Canal University
10 PUBLICATIONS 62 CITATIONS 32 PUBLICATIONS 279 CITATIONS

SEE PROFILE SEE PROFILE

All content following this page was uploaded by Anis Ben Aissa on 16 October 2020.

The user has requested enhancement of the downloaded file.

 Vol.10 (2020) No. 3
ISSN: 2088-5334

A New Method of Data Encryption based on One to One Functions

Osama R. Shahina,b,1, Anis Ben Aissaa,2, Yasser Fouadc, Hassan Al-Mahdid, Mansi Alsmaraha
a
Department of Computer Science & Information, Jouf University, Gurayat, Saudi Arabia
E-mail: [email protected]; 2aabenaissi @ju.edu.sa

b
Physics and Mathematics Department, Faculty of Engineering, Helwan University, Egypt

c
Department of Computer Science, Faculty of Computers & Information, Suez University, Suez, Egypt
d
Department of Computer Science, Faculty of Computers & Informatics, Suez Canal University, Ismailia 41522, Egypt

Abstract— Due to the rapid growth of computer networks, critical highly confidential information shared across these networks.
Accordingly, securing such information from unauthorized intruders has become a vital issue in the field of information technology.
In this paper, we present a new algorithm for encrypting and decrypting English plain text based on the well-known Caesar's
algorithm and a special type of functions called One to One function. The proposed algorithm is referred to as the One to One
function algorithm (OtO). The OtO belongs to a symmetric key concept where the same key is used in both encryption and decryption
processes. In the OtO algorithm, the triplet (K, a, b) represent the private keys. To speed up the proposed OtO computation, the value
of K is calculated based on Fibonacci sequence, on eigenvalues, Leslie matrices and Markov chain. This private key K only knew to
the transmitter and receiver and considered one of the private keys used in the encryption process. When the message arrives at the
receiver, it uses the inverse function of the proposed one to one function that used at the transmitter. The proposed OtO algorithm is
conducted using MATLAB and its efficiency is checked in terms of encrypted time, decrypted time, and Avalanche Effect. We think
that the obtained results are acceptable compared to famous algorithms DES, 3DES, AES and RSA.

Keywords— cryptography; symmetric encryption; fibonacci sequence; eigenvalues; one to one function.

for securing and moving messages from one location to

I. INTRODUCTION another. There are many encryption algorithms, such as
Information is currently a treasure and wealth of peoples public and private keys and digital signature. Encryption has
and countries, especially with the expansion of four objectives: Confidentiality, Integrity, Authentication,
communication between the various parts of the globe. The and Non-repudiation. Encryption algorithms are divided into
extensive use of technology is due to the development of two main types: symmetric (or private key) encryption and
new technologies such as the Internet, mobile phones, and asymmetric (or public key) encryption [5].
computers. Therefore the subject of information security has
gained particular importance in different areas of daily life.
Information security can be defined as a set of techniques,
standards, and practices that are applied to information to
maintain its integrity [1, 2]. Encryption is a method of
converting plain text data into something that looks random
and meaningless (ciphertext) to protect information from
being accessed by unauthorized people. It was developed by
mathematicians such as Francois Vite 1540-1603, John
Willias 1616-1703, William F. Friedman 1920, and Lester S.
Hill 1929. Ronald Reeves (1977), also known as a science
that uses mathematical methods to encrypt and decrypt data.
[3]. The exchange of hidden information and encryption is
an important area of information security that involves
Fig. 1 General Construction of Symmetric Encryption Algorithms.
different methods. [4] Encryption provides an essential tool

1169
 Traditional encryption is also called symmetric the plain text to 64 bits ciphertext through a series of
cryptography (Cryptography Symmetric) and uses a single operations. This algorithm was also developed in 1978 as a
key for data encryption and decryption. The use of this type Triple Data Encryption Standard (3DES). The 3DES divide
of encryption began with Julius Caesar, one of the Roman a length of 112 ~ 192 bits into three partial keys. The DES
czars (51-58 BC). This type of encryption is still used in algorithm uses each partial key to encrypt the plain text.
military and commercial fields. This type of encryption RSA involves a public key and a private key. The public key
remains the most used compared to other encryption types is used to encrypt messages, but encrypted messages can
[6]. Figure 1 shows an illustration of the symmetric key only be decrypted using the private key. These keys are
encryption method. formed for the RSA algorithm in various ways [10].
The Caesar code is one of the symmetric encryption Blowfish is one of the world's most widely used
methods in which each alphabet character is encoded by cryptographic algorithms, introduced in 1993 by Bruce
replacing it with another alphabet character. For example, in Schneier, one of the world's leading Egyptologists, and
the case of a three-digit offset, the order of the alphabet is president of Counterpane Systems. This algorithm encrypts
as shown in Table I. explicit 64-bit text encryption with a 32 ~ 448-bit two-part
TABLE I
encryption key. Many researchers have, in the past,
REARRANGE THE ALPHABET USED IN CAESAR'S ALGORITHM attempted to discover the best encryption and decryption
algorithm [11].
after the after the The work was then carried out by researchers Joan
Alphabet → Alphabet →
offset offset
Daemen and Vincent Rijmen to create the AES: Advanced
A → D N → Q
B → E O → R
Encryption Standard (1998). A shared secret key is used for
C → F P → S 256-bit encryption and decryption. Converting to 128-bit
D → G Q → T encrypted text, Singh's work [12] is an excellent example of
E → H R → U this because it is a comparison of different symmetrical
F → I S → V algorithms, including DES, 3DES, and AES. Similarly,
G → J T → W Cornwell's effort [13] was that the Blowfish algorithm could
H → K U → X keep the information confidential, according to the
I → L V → Y researcher. Many Blowfish researchers have found an ideal
J → M W → Z method of encryption and decryption, including Nadim [14],
K → N X → A who has proven that Blowfish algorithms can compete with
L → O Y → B other algorithms. Besides, Nadim's work concluded that
M → P Z → C AES is much more sophisticated than DES and 3DES.
Similarly, Seth [15] compared three algorithms: DES, AES,
Accordingly, to encrypt the word HELLO using the Julius and RSA. They concluded that RSA lacks longer coding
Caesar method, the character H will replace the character K time and higher memory than the other two algorithms. The
and the character E will be replaced by the character H and rest of this paper will be organized as follows. In section II,
so on. It is worth noting that the amount of displacement in we present the methods of the proposed algorithm. Section
this method is the encryption key that only the transmitter III, the results, and discussion are represented. Finally, the
and receiver know [7]. Public key encryption is also known last section covers the conclusion of this paper.
as asymmetric cryptography. Figure 2 demonstrates the
asymmetric essential encryption process. II. MATERIAL AND METHODS
The proposed One to One function (OtO) algorithm
follows the symmetric encryption system for a private key
(or symmetric key) that uses the same key for transmission
and reception. The OtO algorithm consists of the following
five phases. The private keys selection, the conversion table
(CT) construction, the one to one function determination and
finally the encryption and decryption processes.
A. Select Private Key
One of the private keys that used in the OtO algorithm is
the number K , this number is generated from the Fibonacci
sequence as follows. The recurrence relation for n ≥ 2 in
Fibonacci sequence can be written as follows:
Fig. 2 General Construction of Asymmetric Encryption Algorithms xn = xn−1 + xn−2 (1)
There are several encryption methods that researchers
have developed and compared to choose the best and most The value of the private key K is set to xn . To speed up
suitable for the field of encryption such as DES (Data the OtO algorithm, the direct solution for (1) can be deduced
Encryption Standard) and RSA (Rivest, Shamir, and as follows. Firstly, the recurrence relation (1) will be written
Adleman) [8] [9]. The DES uses a shared secret key used for in the matrix form as follows:
56-bit encryption and decryption. This algorithm converts

1170
  x  1 1  xn −1 
n n
1− 5  1+ 5 
xn =  n  =   , n≥2 (2) 1 = C1   + C2   (11)
 xn −1  1 0  xn − 2  2   2 
   
The characteristic equation of the coefficient matrix, i.e. The values of the constants and can be obtained by
solving (11) and (12) simultaneously to get:
1 1
A=  will be:
1 0 1 1
C1 = − , C2 = (12)
λ − λ −1 = 0
2
(3) 5 5
1− 5 1+ 5
The solutions λ1 = and λ2 = of equation By substituting for the values of the constants C1 and C2
2 2 into (9), the required direct formula that required to calculate
(3) are the eigenvalues of the matrix A. The eigen spaces are
the private key K is given as :
given as:
 λ    λ   1  1 + 5  n  1 − 5  n 
E1 = span  1  , E1 = span  2   (4) K=   −   (13)
  1     1   5  2   2  
 
Once, λ1 ≠ λ2 , the matrix A can be written as follows: The following algorithm describes the process of
A = PDP −1 (5) generating the private key K , where the symbol ⊗ denotes
the binary XOR operation.
λ λ2  λ 0 
Where P =  1  , and P =  1  . So, the matrix A
1 1   0 λ2  Algorithm 1: Generating the private key K
will equal to: 1: Input: n1 , n2 , n3 , n4
−1
λ λ2  λ1 0  λ1 λ2  2 n ← ni
A= 1   
 1 1   0 λ2   1 1  (6) 2: for i ← 2 to 4
1 λ λ2  λ1 0   1 − λ2  3: n = n ⊗ ni
=  1
L  1 1   0 λ2  − 1 λ1  4: end for
 1 + 5 n  1 − 5 n 
Where L is the determination of matrix P . The matrix A j 1
5: K←   −  
can be written as: 5  2   2  
0   1 − λ2   
1 λ1 λ2  λ1
j
Aj =    (7) 6: End
L  1 1   0 λ2j  − 1 λ1 
From Leslie matrices and Markov chain, we can write xn as
B. Conversion Table
follows:
The conversion table (CT) is created for all characters
xn = An −1 x1 used in the encoding process based on the value of the
1 λ1 λ2  λ1n −1 0   1 − λ2  1 (8)
private key K . Thus process will be executed at both the
=    sender and receiver sides. Each character is given an integer
L  1 1   0 λn2 −1  − 1 λ1  0 number as an identifier (ID). The process starts with
substituting all characters with their decimal ASCII code
1  λ1n − λn2 
=   values. The ASCII code corresponding to each character is
L λ1n −1 − λn2 −1  then converted to eight binary formats. XORing every eight
Then, binary formats to the private key K . The resulting eight
n n binary formats is converted to decimal number and then to
1− 5  1+ 5 
xn = C1  + C2 
  2 
 (9) Coded Character (CC). To clarify the generation process of
 2    the CT, let the four numbers that responsible for generating
the private key K are given as
Where C1 and C2 can be evaluated from the first and n1 = 184, n2 = 235, n3 = 224 and n4 = 180 . By using
second terms of Fibonacci sequence. If the first term algorithm 1, the value of K is calculated to 13 with binary
value 00001101. As shown in Table 2, column five
f 0 = 0 then the corresponding equation will be: represents the XORing of the binary value for the ASCII
codes with K = 00001101 . The resulting values are
C1 + C2 = 0 (10) converted into decimal and then to their corresponding CC
according to the ASCII code table. Now, the last column,
If the second term f1 = 1 then the corresponding equation CC, is the replacement of the second column. The resulting
CT is a modified version of that is used in Caesar's
will be:
algorithm, where the XORing operation with the value of K
replaces the offset used Caesar's algorithm.

1171
C. One to One Function 26 Z 90 01011010 01010111 87 W
The one-to-one function has an important mathematical 27 [ 91 01011011 01010110 86 V
property, which is the only function that can have an inverse 28 \ 92 01011100 01010001 81 Q
function. A function is one-to-one if for any output we have
only one input whose image gives that output. In other 29 ] 93 01011101 01010000 80 P
words, the function f (⋅) is one-to-one on domain D if 30 ^ 94 01011110 01010011 83 S

f ( x1 ) ≠ f ( x2 ) , whenever x1 ≠ x2 in D . The relationship 31 _ 95 01011111 01010010 82 R

between a single function and an inverse function is that the 32 @ 64 01000000 01001101 77 M
field of one is considered a field opposite to the other and
vice versa, as shown in Figure 4. Therefore, in this paper, we The constants a , b and K collectively represent the
assume a single-to-one coupling function given as follows: private key known only to the transmitter and receiver. The
inverse function f −1 (x ) for the proposed function in (14)
f (x) = a x + b (14)
must satisfy the following conditions:
Where a is positive real number except for a = 0, 1 , x and 1. The function f ( x ) is a one-to-one function.
b are any real numbers given that b < x . Using the inverse 2. ( )
f f −1 ( x ) = f −1 ( f ( x )) , for all x in f ( x ) the
function ensures that we have one code for each encoded domain.
character, even if this character is repeated it will have a
The inverse function f −1 ( x ) can be calculated using (14)
different code depending on its place within the sentence.
The variable x expresses the ID of the character to be
encrypted. The value of x is obtained from the CT as in as follows.
Table II. x = a f (x ) + b
TABLE II
which gives
THE MODIFIED CT OF THE PROPOSED SCHEME
f ( x ) = log a ( x − b )
−1
(15)
Character

The equation (15) represents the inverse function that the

Binary
ASCII

ASCII

After XOR
CC
ID

receiver will use it to return the encoded character to the

s

with K=13
original one.

1 A 65 01000001 01001100 76 t D. Encryption Process.

2 B 66 01000010 01001111 79 O First, the transmitter generates the Priv = ( K , a, b ) and
3 C 67 01000011 01001110 78 N
sends it to the receiver side over a secure channel. To clarify
4 D 68 01000100 01001001 73 I the encryption process, we try to encrypt the simple plain
5 E 69 01000101 01001000 72 H text Ptxt="DATA_ENCRYPTION_ALGORITHM" with
6 F 70 01000110 01001011 75 K length L . Let n1 = 184 , n2 = 235 , n3 = 224 and
7 G 71 01000111 01001010 74 J n4 = 180 . In addition, the initial values of a and b are set
8 H 72 01001000 01000101 69 E to 1.1 and 0 respectively. The following steps will occur to
9 I 73 01001001 01000100 68 D encrypt this plain text statement:
10 J 74 01001010 01000111 71 G • Calculate the value of and the private number K
using algorithm 1.
11 K 75 01001011 01000110 70 F
• Generate the CT as depicted in Table 2.
12 L 76 01001100 01000001 65 A • Extract the characters of the plain text from the CC
13 M 77 01001101 01000000 64 @ column in the CT.
14 N 78 01001110 01000011 67 C • For each extracted character, determine its ID from the
first column in the CT as shown in Table III. The ID
15 O 79 01001111 01000010 66 B
value the replacement of the x value in (14).
16 P 80 01010000 01011101 93 ]
17 Q 81 01010001 01011100 92 \ TABLE III
x VALUES FOR CHARACTERS TO BE ENCODED
18 R 82 01010010 01011111 95 _
19 S 83 01010011 01011110 94 ^ Letter ID = x Letter ID = x Letter ID = x
D 9 Y 20 O 2
20 T 84 01010100 01011001 89 Y
A 12 P 29 R 31
21 U 85 01010101 01011000 88 X
T 25 T 25 I 4
22 V 86 01010110 01011011 91 [
A 12 I 4 T 25
23 W 87 01010111 01011010 90 Z
_ 18 O 2 H 5
24 X 88 01011000 01010101 85 U
E 8 N 3 M 32
25 Y 89 01011001 01010100 84 T

1172
 E 8 _ 18 Ctxt = [2.5BA2 716A B795 135E 3CDD 12.EA84 79CC
N 3 A 12 CA9E 7449 D3DF 2D9.A41A 40F3 E616 49EE 609B
3C.B1A1 F588 ADB9 0B4E E89B 5CD.E453 08BB 9064
C 14 L 1
66B1 E5C1 31.F31E 9744 D59D 0000 80D9 6.E9BA 5E35
R 31 G 10 3F7C ED91 6873 EAC.2222 1C8A 7A41 E57D 9DBB
1A19 9E6E 10 000C 83B7 6214 1C.FBEF BEEA 3614
The values of the pairing function are calculated one by 391D 0219 6.C28F 5C28 F5C2 8F5C 28F6 10.A 1C1 D25E
one for each value of the variable xi , i = 1,2,3, K, L 2 4A4F.AAAC D9E8 3E42 5AEE 632 2.CCCC CCCC
separately, the initial value of a1 is set to 1.1 and then CCCC CCCC CCCD A458.C 9 6B.DB8C 03AE E129 7B23
8CCD 859 69F7 6527 1CA.5AAA AB39 D50D E3EE 5182
incremented gradually by 0.1. Where, the initial value of b1 391 8FA8 303C 3384].
is set to 0 and the subsequent values of bi will be obtained
E. Decryption Process.
from the following equation:
The decryption process represents the encryption process
bi = mod(bitsi −1 , xi ), i = 2,3,4, K, L (16) but in reverse order. When receiving the Ctxt vector from
the receiver side, the Hexadecimal Codes vector is converted
Where bitsi −1 denoting the number of bits of the binary into a decimal vector whose elements represent the
value of f ( xi ), i = 1, 2, 3, K, L . Table IV represents the xi , i = 1,2,3, K, L values. Using the initial value of the
values of the one to one function defined by equation (14), private keys a and b , the inverse function values for each
based on the location of each character of the Ptxt. number in the decimal vector is calculated and done as
shown in Table V. The inverse function values represent the
TABLE IV
character places in CT Table II, which is also present at the
X VALUES FOR CHARACTERS TO BE ENCODED. receiver, so the final decryption form of the receiving Ctxt
will be given as Ptxt="DATA_ENCRYPTION_ALGORITHM".
f ( xi )
i xi ai bi ai + bi bitsi −1
TABLE V
1 9 1.1 0 2.357947434 22
xi VALUES FOR CHARACTERS TO BE ENCODED
2 12 10 18.91608392 24
f ( xi )
1.2 −1
xi ai bi
3 25 1.3 24 729.6410256 28
4 12 4 60.69387755 26 2.357947434 1.1 0 9
1.4
5 18 8 1485.891892 31 18.91608392 1.2 10 12
1.5
6 8 7 49.94968553 26 729.6410256 1.3 24 25
1.6
7 3 2 6.913 22 60.69387755 1.4 4 12
1.7
8 14 8 3756.133333 31 1485.891892 1.5 8 18
1.8
9 31 0 437886574 32 49.94968553 1.6 7 8
1.9
10 20 12 1048588 21 6.913 1.7 2 3
2
11 29 21 2209833492 32 3756.133333 1.8 8 14
2.1
12 25 7 363552411 29 437886574 1.9 0 31
2.2
13 4 1 28.98412698 23 1048588 2 12 20
2.3
14 2 1 6.76 22 2209833492 2.1 21 29
2.4
15 3 1 16.625 8 363552411 2.2 7 25
2.5
16 18 8 29479518 25 28.98412698 2.3 1 4
2.6
17 12 1 150095.6667 37 6.76 2.4 1 2
2.7
18 1 0 2.8 22 16.625 2.5 1 3
2.8
19 10 2 42072.75 18 29479518 2.6 8 18
2.9
20 2 0 9 4 150095.6667 2.7 1 12
3
21 31 4 1706917413072329 51 2.8 2.8 0 1
3.1
22 4 3 107.8576052 22 42072.75 2.9 2 10
3.2
23 25 22 9180122932519 44 9 3 0 2
3.3
24 5 4 458.3541667 29 1706917413072329 3.1 4 31
3.4
25 32 29 257144606263358340 58 107.8576052 3.2 3 4
3.5
9180122932519 3.3 22 25
The following vector of the Hexadecimal Codes denotes 458.3541667 3.4 4 5
the ciphertext (Ctxt) of the plain text. 257144606263358340 3.5 29 32

1173
 III. RESULTS AND DISCUSSIONS (encryption or decryption), and the size of the file. In our
Each cryptographic algorithm has its own strong and case, we make a test for a file with a size of 3 MB in the
weak points. Several performance metrics are used to encryption test.
compare algorithms. For our experiment, we will compare TABLE VI
the proposed algorithm named “OtO” with the most COMPARISON OF USED MEMORY
encryption methods used like DES, 3DES, AES, and RSA. Algorithm Memory used in KB
We evaluate the proposed OtO in terms of encrypting time,
decrypting time, memory used, and the avalanche DES 20.3
effect. We carry out the algorithms using Matlab IDE, 3DES 23.6
personnel computer with 2.4 GHz CPU and 6 GB of AES 19.2
memory. In addition, we use plain text with different size RSA 36.9
OtO 30.3
such as 256 KB, 512 KB, 1 MB, 2 MB and 3 MB.
A. Encrypting Time D. Avalanche Effect
Figure 3 shows that RSA takes the highest encryption The Avalanche Effect measures the correlation between
time for any file size compared to DES that takes the least bits of ciphertext and body text bits. In other words, the
time encryption undependable of file size. For the OtO breakdown test measures the change in ciphertext when a bit
encryption method, we notice that it is faster than RSA and in the plain text or master key is changed [16]. To this end,
3DES for the larger file up to 2 MB. more than one value has been proposed for the encryption
keys (a, b), which have the most significant effect in
changing the shape of the encrypted text in case of similarity
Encryption time vs file size of characters or even increase or decrease the character of a
2000 word as shown in Table 7 and 8. It should be noted that the
quality of the Avalanche Effect scale is high if the change of
1500
a single character, whether increased or decreased in the
1000 ciphertext, affects more than fifty percent of the coded text
500
bits from the ciphertext before changing this cell. [16]. The
equation of the avalanche effect can be written as follows:
0
DES 3DES AES RSA OtO bit changed (16)
Avalanche Effect =
bit total
256 KB 512 KB 1 MB 2 MB 3 MB
where, bit changed is refers to change only one bit in
Fig. 3 Encryption time vs file size for DES, 3DES AES, RSA and OtO
ciphertext, and bittotal is a total number of bits in the cipher
B. Decrypting time text. Tables VII and VIII showed that the proposed
Figure 4 shows that the proposed method OtO is a stable algorithm has a very good Avalanche Effect property with
time for size file larger than 1 MB and its better than RSA. an average of 45%.
On the other hand, the proposed OtO takes less time for TABLE VII
decryption compared to 3DES and AES when for 512 KB. AVALANCHE VALUES OF PLAINTEXT

Bits Avalanche
Plaintext Ciphertext Bits
Decryption time vs file size changed test
2.24C2 4C26 8561
2000 0E9E E56F 2.BA5E
353F 7CED 9168 72B
1500 2F.5FAD 4095 716B
D30C D7D5 8471
ENCRYPTION D0D.41A4 15F4 5E0B 205 – –
1000 4E11 DBCB C AD32 8
CE3B A.7F63 3731
500 F068 077B 4977
3.9C28 F5C2 8F5C
28F5 C28F 9
0 2.24C2 4C26 8561
DES 3DES AES RSA OtO 0E9E E56F 16B.D269
3477 0011 9DB7 358C
256 KB 512 KB 1 MB 2 MB 3 MB 32.5FAD 4095 716B
D311 D7D5 8472
Fig. 4 Decryption time vs. file size for DES, 3DES AES, RSA and OtO EMCRYPTION D05.41A4 15F4 5E0B 201 96 0.4682926
4E11 DBCB C AD32 8
C112 A.7F63 3731
F068 077B 4977 3.2231
C. Memory Used E231 8F5C 28F5 C28F
Comparing memory used for different algorithms 9
depending on the complexity of code used, type of operation

1174
 2.24C2 4C26 8561 IV. CONCLUSION
0E9E E56F 2.BA5E
353F 7CED 9168 72B In this paper, we introduced a new algorithm of data
2F.5FAD 4095 716B encryption based on Caesar's Algorithm and One to One
D30C D7D5 1.6666 function. The proposed algorithm has four steps easy to
6666 6666 6666 6666
ENCLYPTION
CFD.41A4 15F4 5E0B
209 70 0.3414634 apply. We used serial tests like encryption time, decryption
4E11 DFFD C EED2 8 time, memory used, and the avalanche effect of evaluating
CE3B A.7F63 3731 the OtO algorithm. We think that the obtained results are
3345 7789 8667 3.9C28 acceptable compared to famous algorithms DES, 3DES,
F5C2 8F5C 28F5 C28F
9 AES, and RSA. In future work, we will try to optimize the
algorithm, and we will test brute force attack vulnerability.
TABLE VIII
AVALANCHE VALUES OF PLAINTEXT
REFERENCES
Bits Avalanche
Plaintext Ciphertext Bits [1] S. Jain and V. Bhatnagar, "Analogy of various DNA based security
changed test
algorithms using cryptography and steganography," (ICICT), 2014
2.5BA2 716A B795 International Conference on, pp 285–291, 2014.
135E 3CDD 12.EA84 [2] J. Yang, J. Ma, S. Liu, and C. Zhang, "A molecular cryptography
79CC CA9E 7449 model based on structures of DNA self-assembly," Chinese science
DATA D3DF 2D7.A41A 40F3 98 - - bulletin, vol 59, no. 11, pp. 1192–1198, 2014.
E616 49EE 609B [3] T.Larrieux, Aurelia. Technical Tools and Designs for Data
3C.B1A1 F588 ADB9 Protection. In: Designing for Privacy and its Legal Framework.
0B4E E89B Springer, Cham, 2018. p. 101-148.
[4] J. L. Philjon and N. Venkateshvara, "Metamorphic cryptography—a
F.DCF3 CF45 221E paradox between cryptography and steganography using dynamic
0D06 4DCD 8.EA85 encryption," (ICRTIT), 2011 International Conference on, pp. 217–
83C4 E874 3F8F 5971 222. IEEE, 2011.
PATA 2D6.A41A 40F3 E616 100 46 0.4693877 [5] M. E. Saleh, A. Aly, and F. Omara, “Data security using
49EE 609B 3C.B1A1 cryptography and steganography techniques,” (IJACSA)
F588 ADB9 0B4E International Journal of Advanced Computer Science and
E89B Applications, vol 7.no. 6, 2016.
2.5BA2 716A B795 [6] H. Al-Mahdi, M. Alruily, O. Shahin, & K. Alkhaldi, “Design and
135E 3CDF C.4CC0 Analysis of DNA Encryption and Decryption Technique based on
D196 E102 8ED0 92D5 Asymmetric Cryptography System. computing,” vol 10, no. 2, 2019.
DETA 2D9.A41A 40F3 99 30 0.4461224 [7] K. Chen, "Cryptography. School of Informatics," University of
DCDC DCD3 FCAB Manchester. pp. 32, 2005.
3C.B1A1 F588 ADB9 [8] B. Silva, J. Rodrigues, F. Canelo, M. Lopes, J. Lloret, “Towards a
0B4E E89B cooperative security system for mobile-health applications,”.
Electronic Commerce Research, vol 19, no. 3, pp. 629-654, 2019.
2.5BA2 716A B795 [9] R. Davis, “The Data Encryption Standard in Perspective,”
135E 3CDD 75.656F Proceeding of Communication Society magazine, IEEE, vol. 16, Nov
DTA 17E5 CFD3 118A 72 50 0.51020408 1978.
6BFF 1A.4C4E C4DF [10] R.L.Rivest, A.Shamir, L.Adleman, “A Method for obtaining Digital
17A8 1258 473F Signatures and Public-Key Cryptosystem,” Communication of the
ACM, vol 21, Feb 1978.
[11] P. Chandra Mandal “Superiority of Blowfish Algorithm,”
Figure 5 shows the AES exhibits the highest Avalanche International Journal of Advanced Research in Computers Science
effect. However, RSA exhibits the lowest Avalanche. and Software Engineering, Vol 2, no. 9, 2012.
[12] G. Singh, A. Kumar, K. S. Sandha, "A Study of New Trends in
Blowfish Algorithm," International Journal of Engineering Research
Avalanche Effect and Application. vol. 1, no. 2, pp.321-326, 2011.
[13] J. W. Cornwell, G. A. Columbus, “Blowfish Survey,” Department of
Computer Science. Columbus: GA Columbus State University, 2012.
70 [14] A. Nadeem, M. Y. Javed "A Performance Comparison of Data
Encryption Algorithms. In Information and communication
60 technologies," (ICICT), First international conference on IEEE,
50 2005.
[15] S. M. Seth, R. Mishra, "Comparative Analysis of Encryption
40 Algorithms for Data Communication," 2011.
30 [16] P. B. Jayant, N. C. Prashant, "Avalanche Effect of AES Algorithm."
IJCSIT) International Journal of Computer Science and Information
20 Technologies, vol. 5, no. 3, pp. 3101-3103, 2014.
10 [17] H. Al-Mahdi O. R. Shahin, Y. Fouad, K. Alkhaldi, “Design and
analysis of DNA Binary Cryptography Algorithm for Plaintext,”
0 International Journal of Engineering and Technology (IJET), vol. 10,
DES 3DES AES RSA OtO no. 3 , pp. 699 -706, 2018 .

Fig. 5 Avalanche effects of the different algorithms

1175

View publication stats