Page 98 - IJEEE-2023-Vol19-ISSUE-1

94 |
database was hacked, the attackers could only get the encrypted
data which is invaluable. At present, the research work mainly
focuses on the confidentiality of stored data, security checks and well as its complex internal structures, ensuring that the
access control, and so on. Fenghua Z.et al. [3] developed the
AES algorithm by P-AES algorithm. The P-AES algorithm is
combined with the RSA algorithm, named a hybrid algorithm,
the obtained results demonstrate the hybrid encryption
algorithm has the benefits of fast encryption and decryption.
Additionally, Yitao C. et al. [2] in their research project
developed a health information management system based on
the Java platform to realize the duties of the system, most of the framework for its iterative structure[13].
hierarchical structure of the system was enhanced according to
the health information management module, also they used the
Data Encryption Standard (DES) algorithm to encrypt and
protect personal healthcare information, the system was
developed to evaluate health information confidence,
information security, and system response time.
In another study, Pramila M. Chawan [4] implemented
multiple layers of security measures containing JWT, CORS,
SHA-256, AES Algorithms, and, IDEA and compared the two
algorithms AES, and IDEA in terms of data privacy. In [5], the
authors suggest adopting the Advanced Encryption Standard
(AES) algorithm for the encryption of the user information
before storing it in the database as well as using an
authentication approach for valid user verification and
protection of unauthorized access to all system functionalities.
In the project work of Owusu N. et al. [6], the AES algorithm
can use multiple cryptographic key lengths of 128, 192, and 256
bits created by C# programming language as a front-end client
machine and MS SQL used for the database as a back-end
machine. Mondal, S. et al. [7], present a method for safer and
more economical encryption system, which randomizes the key
of the AES algorithm and covers the key data into the encrypted
digital image by applying the basic concepts of cryptography
and digital watermarking. W Xing-hui and M Xiu-jun [8]
proposed a hybrid encryption method in databases, they adopted
RSA and IDEA algorithms which are public key and symmetric
key respectively. Firstly, the database is encrypted by RSA
algorithm and then these keys were used to encrypt the plain data
using the IDEA algorithm. This hybrid system enhances the
security of data and make it more immune against attacks.
Furthermore, the authors in [9] present a system that provides
password encryption using hashing functions such as MD5,
SHA, etc., they also proposed a novel modification that
enhanced the security using a hashing function. Min-Shiang
Hwang and Wei-Pang [10] proposed two methods of encryption
techniques depending on the concept of sub keys that gives some
security; moreover, solves key management problem which
allows multiple users to right access. Table III shows a
comparative study.
III. DESCRIPTION OF AES ALGORITHM
Joan Daemen and Vincent Rijmen created the AES block
cipher, which is also known as the Rijndael algorithm. The
method runs smoothly on a wide range of computer processors
and hardware [11]. AES is based on a design concept known as
a substitution-permutation network, which is a combination of
substitution and permutation, and is fast in both software and
Baban & Hameed
hardware. AES does not employ a Feistel network, unlike its
predecessor DES. The thorough AES development process, as
algorithm is extremely safe and has no known flaws. Rijndael's
key length can be 128, 192, or 256 bits, depending on the AES
requirements. The Rijndael algorithm has variable block sizes,
which can range from 128, 192, or 256 bits. This means that a
Rijndael method with key sizes of 128, 192, and 256 bits gives
nearly the same amount of security [12]. The round
transformations used in this encryption technique serve as a
AES is one of the most up-to-date algorithms of the four
currently certified for federal use in the United Statuses uses a
four-by-four (4 x 4) column-major-order byte matrix called the
state, while certain Rijndael variants use a larger block size and
have more columns inside the state. AES composition and
building blocks were created based on a standard known as a
substitution-transformation arrangement with a set block size of
128 bits and a key size of 128, 192, or 256 bits, and has a high-
speed in both software and hardware (see Figure 1). The AES
technique encodes 10 cycles for 128-bit keys during encryption
and decryption. To get the last encoded message, go through 12
rounds for 192-bit keys and 14 rounds for 256-bit keys [14].
The encryption begins with a "Add round key stage" for
encoding and decoding. However, shortly before the final
round, the output is subjected to nine fundamental rounds, each
of which includes four transformations: 1) Sub-bytes, 2) Shift-
rows, 3) Mix-columns, and 4) Add round Key. Mix column
transformation is not accessible in the ninth round [15-
17].Decryption is the inverse procedure, with the following
stages [18]:
1. Substitute Byte Transformation: AES is made up of 128-
bit data blocks, which means that each database item
comprises 16 bytes. By implementing an 8-bit
substitution box known as the Rijndael s-box, every bite
of a data item is turned into another piece in sub-byte
transformation.
2. Shift Rows transformation: This transformation is
simple; the bytes in the state's last three lines, which are
dependent.
3. On row position, are moved in a cycle. The second line
does a 1-byte circular left shift. Two bytes and three
bytes left circular shifts are performed in the third and
fourth rows, respectively.
4. Mix columns transformation: This is the inverse of a
multiplication set of each state's column. Every is
multiplied by a stable matrix. Bytes are treated as multi-
names in this procedure.
5. Include a round key transformation: a bit-like XOR
between the current state's 128 bits and the round key's
128 bits. This is the polar opposite of transformation.
The Table I shows a comparison of cryptography symmetric
algorithms based on common factors.