Page 101 - IJEEE-2023-Vol19-ISSUE-1

Baban & Hameed | 97

implementation is done by using different sizes key128,192 and Meanwhile, the performance evaluation of the AES is based also
256 bits, AES algorithms as shown in the figure 4 below: on the memory parameter and effect on Intel-Core i7-6600U
Processor (8M Cache, up to 2.6 GHz) with RAM 64GB. The
Fig.4: User Database Table of AES- HMAC-SHA256 results in Figure 7 demonstrate that the AES-256 need moreMemory Usage (KB)
Security System. space of memory to encrypt the data.

B. Experimental Results 300

All experiments were done on a laptop hp Elitebook 2.6 GHz 250
Intel processor with 16GB memory and 512GB hard disk. The
operating system which was used is 64bit Windows 10. The 200
results were executed based on the database XAMPP
phpMYAdmin Server and the programming language is PHP, 150
HTML, CSS, and JAVASCRIPT. Performance comparison of 2 4 8 16
symmetric encryption algorithm AES based on the execution
time of Encryption with different types of keys length 128,192 Data Length
and 256 bits and study is performed on the effect of changing
plaintext length 2,4,8 and 16 respectively on encryption time, AES-128 AES-192 AES-256
CPU workload and amount of the memory usage. Fig. 7: Reserved Memory (KB)

Figure 5, shows the execution time in the encrypting As the entropy test, a famous measure of uncertainty in the
process for three types of AES keys over different lengths of
plaintext. The units of encryption time were measured in theory of knowledge was described in 1948 by (Shannon, 1948)
milliseconds. Overall, the consumption time of encryption
using AES-256 is higher than the rest of the AES types. [33]. Shannon proposed that entropy H(X) could be calculated

100 by the average amount of information of a discrete random

variable X

n (2)

åH ( X ) = P (xi )log2 P(xi )
i =1

on the following terms:

Time (m sec) 50 X consists of a finite of a sample space x1, x2, x3,.., xn;
P(xi) probability distribution, xi ³ X ;
0
2 n

å• And 1p(xi )
i

48 16 Entropy analysis measures the complexity of encrypted data
Data length
[34]. As the proposed security system consists of encrypted

massage using AES combined with HMAC -256 that lead the

AES-128 AES-192 AES-256 optimum entropy value is 5. 580.Thus, a value that is close to

Fig. 5: Time consumption for encrypt different 5.580 corresponds to the high complexity of encrypted data.
length of text transmission (millisecond).
Table II shows that combination of AES and HMAC algorithms
Results of the experiment for measuring the percent of CPU
used are presented in Figure 6. As one can see, the average records the highest average entropy per byte in contrast if using
value is just above 7% when encrypted the message by the
AES-256 algorithm. only AES algorithm. increasing entropy leads to making the data

8 less susceptible to attack.

6 TABLE II

4 AVERAGE ENTROPY VALUES

2 Data Average entropy Average entropy per
Length per byte byte
0
CPU usage (%) 2 4 8 16 Type of Type of Algorithm /
Data Length
Algorithm / AES AES with HMAC

2 3.2743 5.4321

4 3.6321 5.4725

8 3.8439 5.41665

AES-128 AES-192 AES-256 16 4.1673 5.5707

Fig. 6: Percentage of CPU used (%)