2024 Beyond Technology Summit on Informatics International Conference (BTS-I2C)

Enhancing Advanced Encryption Standard with

Chaotic Map and Dynamic S-Box
Candra Tangguh Pradipta Riyanarto Sarno Abdullah Faqih Septiyanto
Department of Informatics Department of Informatics Department of Informatics
Institut Teknologi Sepuluh Nopember Institut Teknologi Sepuluh Nopember Institut Teknologi Sepuluh Nopember
Surabaya, Indonesia Surabaya, Indonesia Surabaya, Indonesia
6025241035@[Link] riyanarto@[Link] 7025221022@[Link]
Dwi Sunaryono
Department of Informatics
Institut Teknologi Sepuluh Nopember
Surabaya, Indonesia
dwi@[Link]
2024 Beyond Technology Summit on Informatics International Conference (BTS-I2C) | 979-8-3315-0857-9/24/$31.00 ©2024 IEEE | DOI: 10.1109/BTS-I2C63534.2024.10942276

Abstract—Advanced Encryption Standard (AES) is one of Standards and Technology (NIST) [6]. In fact, it was the first
cryptography algorithms widely used for protecting data across encryption algorithm by NIST that has been approved and
various sectors of technology. Although widely used, there are made publicly accessible. AES algorithm has been widely
still some vulnerabilities in AES, notably the fixed S-Box and the used for various purposes, including secure communication,
lack of a MixColumn step in the final encryption round, which VPNs, and payment systems as demonstrated in [7], [8], [9].
limit its resistance against specific cryptographic attacks. This However, there are certain vulnerabilities in AES system. For
paper proposes a new enhanced AES algorithm targeting 128- example, the use of fixed S-Box can be considered to provide
bit key encryption, including the introduction of dynamic S-Box inadequate protection. Another vulnerability includes the
to replace the fixed S-Box, key generation based on Chebyshev
absence of MixColumn step in last round which lacks an
chaotic map, and modified encryption process incorporating
MixColumn step in the final round and reduction of number of
effective role in security factor [10]. Previous studies [11],
rounds. These modifications aims to increase complexity and [12], [13] have proposed solutions for these vulnerabilites by
improve resilient against decryption against unauthorized implementing various modifications to the AES algorithm.
parties, while improving the performance of the algorithm. This paper proposes a new enhanced AES algorithm by
Experimental results demonstrated that the proposed algorithm modifying the encryption process. The proposed algorithm
successfully enhanced both security and performance. The introduces some modifications on the standard AES,
proposed algorithm achieves a higher average avalanche score
including: subtituting static S-Box with dynamic S-Box,
of 53.02 %, surpassing the standard AES score of 50.00 %. For
shuffling encryption key using chaotic map, reducing the
the encryption time, the proposed algorithm demonstrates
faster encryption time across various file sizes, with a reduction
number of rounds, and adding MixColumn step on the last
of approximately 20% compared to the standard AES. round of encryption.

Keywords—AES, chaotic map, chebyshev map, cryptography, II. RELATED WORKS

dynamic S-Box
Several previous studies have explored the modifications
to the AES algorithm as listed below :
I. INTRODUCTION
A. AES Encryption
With the rapid growth of data processing technology, data
security has become one of the most pressing concerns that AES is a block cipher algorithm introduced by NIST in
must be prioritized across different sectors such as financial 2001 [6]. The algorithm supports three key lengths : 128,192,
services, healthcare, education, even the government [1]. and 256 bit. This paper focuses on the 128-bit key length
Moreover, data can be accessed remotely by anyone with ease encryption. In 128 bit-key encryption, the number of rounds
[2]. Data security itself refers to the process of protecting is 10 rounds. The flowchart of standard AES encryption
digital information from physical harm or theft, while process is as shown in Fig 1.
ensuring its confidentiality and availability remain intact [3].
One of the most commonly used method to ensure data
security is cryptography. The word cryptography originates
from Greek, meaning “creating secrecy”. It is a process of
transforming original information, known as plaintext into
secret information called ciphertext [4]. Cryptography can be
classified into two types : symmetric key encryption and
asymmetric key encryption. Symmetric key encryption uses a
common key for both encryption and decryption process.
While in asymmetric key encryption, two different keys are
used : public key for encryption and private key for decryption
[5]. In this paper, we focus on one implementation of
symmetric key encryption, namely the Advanced Encryption
Standard (AES).
AES encryption was developed by Joan Daem and
Vincent Rijmen and introduced by National Institute of Fig. 1. AES Encryption

Authorized licensed use limited to: Indian Institute of Space Science And Technology. Downloaded on July 02,2025 at 18:08:05 UTC from IEEE Xplore. Restrictions apply.
979-8-3315-0857-9/24/$31.00 ©2024 IEEE 393
 AES takes plaintext as input. The plaintext is then D. MixColumn Step
encrypted through a sequence of processes as many times as In a standar AES, the encryption process consists of four
the number of rounds. Every round, with the exception of the steps each round : SubByte, ShiftRow, MixColumn, and Add
last round, includes four steps : SubBytes, ShiftRows, Round Key; except for the last round where MixColumn is
MixColumn, and RoundKey. In the last round, MixColumn absent. Research by [13] proposed a modification on the last
step is absent. round of encryption by implementing MixColumn. Another
research [17] provided a completely different approach
B. Dynamic S-Box regarding this matter. Instead of using MixColumn on each
Standard AES encryption uses a predefined static Rijndael round, this research replaced it with a new process called
S-Box in SubByte step. SubByte is a non-linear “permutation”.
transformation where each byte in the state undergoes a
substitution based on substitution table (S-Box) independently III. PROPOSED METHOD
[14]. The sequence of processes in the SubByte operation is
as follows: a) 16x16 S-Box is constructed using a combination We propose a new AES algorithm with modifications on
of mathematical transformations : inversion of Galois Field its encryption process as shown in Fig. 2.
GF(28) and affine transformation. b) Each byte in the state is A. Modified S-Box
replaced with the corresponding value from the S-Box. Affine
transformation in standard AES is shown in Equation 1, where In this study, we propose a dynamic S-Box as a
the obtained value of b undergoes an XOR operation with a replacement for the static S-Box used in standard AES.
constant value equals to 0x63 in hexadecimal. Instead of using 0x63 as a constant value, this method uses a

1 0 0 0 1 1 1 1 ⎡ 1
value obtained from the the first byte of the key. In result, the
⎡ ⎤ ⎡1 ⎤
1 0 0 0 1 1 1⎤ ⎢ ⎡1⎤
affine transformation formula becomes as follows in
⎢ ⎥ ⎢1 ⎥
1 1 0 0 0 1 1⎥ ⎢ ⎢0⎥
Equation 3, where x0 to x7 is the binary value of the obtained
⎢ ⎥ ⎢ ⎥ ⎥ ⎢ ⎥
⎢1 1 1 1 0 0 0 1⎥ ⎢ ⎢0⎥
value. For example, the given key in hexadecimal is “ 70 61
⎢ ⎥ ⎥
⎢1 1 1 1 1 0 0 0⎥ ⎢ ⎢0⎥
73 73 77 6F 72 64”. On this case, the value used for XOR
⎢ ⎥ ⎥
(1)
⎢ ⎥ ⎢0 1 1 1 1 1 0 0⎥ ⎢ ⎢1⎥
operation in affine transformation is 0x70 (binary :
⎥
⎢ ⎥ ⎢0 0 1 1 1 1 1 0⎥ ⎢ ⎢1⎥
01110000).
⎥
⎣ ⎦ ⎣0 0 0 1 1 1 1 1⎦ ⎣ ⎦ ⎣0⎦ 1 0 0 0 1 1 1 1 ⎡
⎡ ⎤ ⎡1 ⎤
1 0 0 0 1 1 1⎤ ⎢ ⎥
⎡ ⎤
⎢ ⎥ ⎢1 1 1 0 0 0 1 1⎥ ⎢ ⎢ ⎥
⎢ ⎥ ⎢ ⎥ ⎥ ⎢ ⎥
⎢ ⎥ ⎢1 1 1 1 0 0 0 1⎥ ⎢ ⎥ ⎢ ⎥
A previous study [11] proposed the substitution of static

⎢ ⎥ ⎢1 1 1 1 1 0 0 0⎥ ⎢ ⎥ ⎢ ⎥
S-Box with dynamic S-Box. While the static S-Box uses (3)
⎢ ⎥ ⎢0 1 1 1 1 1 0 0⎥ ⎢ ⎥ ⎢ ⎥
constant hex value of 0x63 (99 in decimal) for XOR operation

⎢ ⎥ ⎢0 0 1 1 1 1 1 0⎥ ⎢ ⎥ ⎢ ⎥
in affine transformation, the proposed method used a random

⎣ ⎦ ⎣0 0 0 1 1 1 1 1⎦ ⎣ ⎦ ⎣ ⎦
generated decimal number between 20 to 255. This
substitution increased the level of complexity in decryption
process by a third party. However, the paper does not explain
how the decryption process involving the random generated
number is performed.

C. Chaotic Map
Chaotic maps are mathematical functions that produce
complex, unpredictable patterns depending heavily on the
starting seed value [15]. Chaotic maps exist in various
dimensions, ranging from one-dimensional to multi-
dimensional.
Several studies have proposed the implementation of
chaotic map in the encryption process. A study [11]
implemented a 1D chaotic map, called Sine Map for new key
generation derived from the original key. Another research
[12] combined 2D and 3D chaotic maps for key generation
process.
This paper proposes implementation of a 1D chaotic map,
named Chebyshev Map. Chebyshev map considered suitable
for encryption due to its efficiency and its ability to offer a
satisfactory level of security and randomness, thanks to its
inherent chaotic properties [16]. Chebyshev Map can be
written as Equation 2.
cos ! arccos $% | | ' 1
cosh ! )*+, ℎ $% . 1
/1 cosh ! )*+, ℎ / $% ' /1
(2)
Fig. 2. Modified AES

Authorized licensed use limited to: Indian Institute of Space Science And Technology. Downloaded on July 02,2025 at 18:08:05 UTC from IEEE Xplore. Restrictions apply.
394
 B. New Key Generation using Chaotic Map IV. RESULT AND DISCUSSION
In this proposed method, chaotic map (Chebyshev Map) For the evaluation process, we tested both proposed AES
is used for new key generation. The key inputted by user is algorithm and standard AES algorithm on five text files of
processed using an algorithm as shown in Table I. This varying sizes, as detailed in the specifications provided in
algorithm converts the key from ASCII text value into Table II.
hexadecimal value.
A. New Key Generation
C. MixColumn
The input key is processed and converted into
The last round of standard AES encryption doesn’t hexadecimal value using the algorithm in Table I. The result
include MixColumn step. In this proposed algorithm, we of the new key generation by the algorithm is as shown in
implemented the MixColumn step in the last round (8th Table III. This new key is then used for the encryption
round) just as shown in Fig.3. This approach is expected to process.
enhance the security level of encryption.
B. Modified S-Box Construction
TABLE I. New Key Generation Using the new affine transformation formula defined in
Algorithm 1 : Key Generation using Chebyshev Map Equation 2, a new S-Box is constructed. Since the value of the
Input : input_key first nibble from the new key obtained in the previous step is
Output : 0x59 (01011001 in binary), the affine transformation formula
1: function generate_new_key(input_key): can be defined in Equation 4.
1 0 0 0 1 1 1 1 1 1
2: mod_key = []
⎡ ⎤ ⎡1 1 0 0 0 1 1 1⎤ ⎡ 0⎤ ⎡ 1⎤
3: for each character in input_key:

⎢ ⎥ ⎢1 1 1 0 0 0 1 1⎥ ⎢0⎥ ⎢ 0⎥
4: mod_key.append(ASCII value of character % 9)

⎢ ⎥ ⎢ ⎥⎢ ⎥ ⎢ ⎥
⎢1 1 1 1 0 0 0 1⎥ ⎢1⎥ ⎢ 0⎥
5: for each value in mod_key:

⎢ ⎥
6: chaotic_sequence = []
⎢ ⎥ ⎢1 1 1 1 1 0 0 0⎥ ⎢1⎥ ⎢ 0⎥
7: repeat 15 times: (4)
⎢ ⎥ ⎢0 1 1 1 1 1 0 0⎥ ⎢0⎥ ⎢ 1⎥
8: y = chaotic_value
⎢ ⎥ ⎢0 0 1 1 1 1 1 0⎥ ⎢ 1⎥ ⎢ 1⎥
9: chaotic_sequence.append(absolute value of y)
⎣ ⎦ ⎣0 0 0 1 1 1 1 1⎦ ⎣ 0⎦ ⎣ 0⎦
10: append chaotic_sequence to chebyshev_map_key
11: chaotic_bytes = []
12: for each value in the first 16 elements of
chebyshev_map_key: Construction of S-Box using the affine transformation in
13: chaotic_bytes.append((value * 100) % 256) Equation 4 resulted in a completely new S-Box as shown in
14: random_key = Generate 16 random values between 1 and 6 Table IV. This new S-Box is then used in the SubBytes
15: new_key = [] process in each round of encryption replacing the Rijndael S-
16: for each chaotic_byte and corresponding random_key byte: Box.
17: new_key.append(chaotic_byte XOR random_key byte)
18: final_key = Convert new_key to bytes C. Distribution of Ciphertext
19: return final_key
To analyze the distribution value in the ciphertext, we use
a histogram diagram. A uniform distribution of values
indicates that an encryption algorithm is effective. The
distribution of byte value from the encryption result using
proposed algorithm can be seen in Fig. 4. The byte value is in
ASCII ranged 0-255. Fig. 4 shows that the ciphertext
distribution is relatively balanced.

Fig. 3. Adding MixColumn to Last Round

TABLE II. Test Data

Input Key 1234567891234567
File Type Text (.txt)
File Sizes 2 KB, 3KB, 4KB, 5KB, 10 KB

TABLE III. New Key Generation

Input Key 1234567891234567
New Key 59172e5912285c152e5e132f5e13295e Fig. 4. Ciphertext Value Distribution

Authorized licensed use limited to: Indian Institute of Space Science And Technology. Downloaded on July 02,2025 at 18:08:05 UTC from IEEE Xplore. Restrictions apply.
395
 TABLE IV. New S-Box
e5 fa f1 fd 74 ed e9 43 b6 87 e1 ad 78 51 2d f0
4c 04 4f fb 7c df c1 76 2b 52 24 29 1a 22 f4 46
31 7b 15 a0 b0 b9 71 4a b2 23 63 77 f7 5e b7 93
82 41 a5 45 9e 10 83 1c 81 94 06 64 6d a1 34 f3
8f 05 aa 9c 9d e8 dc 26 d4 bd 50 35 af 65 a9 02
d5 57 86 6b a6 7a 37 dd ec 4d 38 bf cc Ca de 49
56 69 2c 7d c5 cb b5 03 c3 7f 84 f9 d6 Ba 19 2e
d7 25 c6 09 14 1b be 73 3a 30 5c a7 96 79 75 54
4b 8a 95 6a d9 11 c2 91 42 21 f8 bb e2 Db 9f f5
e6 07 c9 5a a4 ac 16 0e c0 68 3e 92 58 d8 8d 5d
66 b4 bc 8c cf 80 a2 da 44 55 2a e4 17 13 62 ff
61 4e b1 eb 0b 53 c8 2f ea d0 72 6c e3 Fc 28 8e
3c fe a3 a8 9a 20 32 40 6e 5b f2 99 cd 3b 0d 0c
f6 b8 33 e0 ce 85 70 88 e7 b3 d1 3f 00 47 9b 18
67 7e 1e 97 ef 5f 08 12 1d 98 01 6f 48 d3 ae 59
0a 27 0f 8b 39 60 c4 ee c7 1f ab 89 36 d2 3d 90

Based on the result in Table V and Fig 5, it can be

D. Performance Evaluation
observed that the proposed algorithm demonstrated faster
The performance of proposed modified AES algorithm encryption time, approximately 20% faster than standard
was evaluated, including encryption time and avalanche AES, across various file sizes. The encryption time
score compared to the standard AES algorithm. For the difference between the two increases gradually as the file
encryption time, the evaluation process was done by testing sizes got larger.
the algorithm in encrypting five text files of different sizes (2 To evaluate the security of the proposed algorithm,
KB, 3 KB, 4 KB, 5 KB, and 10 KB). The result of the test can avalanche effect test was done. Avalanche effect refers to a
be observed in the Table V and Fig 5. property where a minor change, even only one bit, in the

A good avalanche score for an encryption algorithm is .

plaintext will result in significant change in ciphertext [18].
TABLE V. Encryption Time Comparison
File Size Encryption Time (s) 50%. Avalanche score can be calculated using Equation 5.
Proposed AES Standard AES
)2)3)!+ℎ4 +,*4 × 100%
2 KB 20.37 24.29 56789 :; ;<=>>8? 7=@A
3 KB 31.32 40.24 @:@B< 7=@A (5)
4 KB 54.05 66.03
5 KB 64.33 77.49
10 KB 134.03 166.73
Avalanche effect test was conducted on three different
plaintexts in hexadecimal value listed on Table VI. The
avalanche score is obtained from the result of flipping the
most significant bit in the plaintext. The result of avalanche
effect test of proposed algorithm compared to standard AES
Encryption Time (s) algorithm is as shown in Table VII. The proposed algorithm
180 produced a better average avalanche score than the standard
AES, even achieving highest score of 58.59 % on Test 2.
150
TABLE VI. Avalanche Test Data
120
Test Data in Hexadecimal
90 Test 1 70 61 73 73 77 6F 72 64 31 32 33 34 35 36 37 38
Test 2 56 71 76 50 39 4A 46 4B 55 5A 69 66 48 4A 42 6A
60 Test 3 67 6B 23 63 37 66 63 40 79 5E 76 5E 31 73 57 64

30 TABLE VII. Avalanche Score

0 Avalanche Score (%)
Methods
Test 1 Test 2 Test 3 Average
2 KB 3 KB 4 KB 5 KB 10 KB
Proposed
53.12 58.59 47.66 53.02
Proposed AES Standard AES AES
AES
52.34 50.00 47.66 50.00
Fig. 5. Encryption Time Comparison Standard

Authorized licensed use limited to: Indian Institute of Space Science And Technology. Downloaded on July 02,2025 at 18:08:05 UTC from IEEE Xplore. Restrictions apply.
396
 V. CONCLUSIONS techniques & algorithms,” Mater. Today Proc., vol. 51, pp. 104–109,
2022, doi: 10.1016/[Link].2021.04.583.
The Advanced Encryption Standard (AES), although [5] S. Chandra, S. Paira, and S. S. Alam, “A comparative survey of
widely implemented, exhibits certain vulnerabilities that symmetric and asymmetric key cryptography,” 2014.
could affect its effectiveness against cryptographic attacks. [6] A. Hamza and B. Kumar, “A Review Paper on DES, AES, RSA
Encryption Standards,” in 2020 9th International Conference System
Specifically, the use of a fixed S-Box and the absence of the Modeling and Advancement in Research Trends (SMART),
MixColumn step in the final encryption round introduces Moradabad, India: IEEE, Dec. 2020, pp. 333–338. doi:
potential weaknesses. In addition, as data sizes increase, the 10.1109/SMART50582.2020.9336800.
performance of the standard AES algorithm can be a limiting [7] A. Wahab, R. B. Bahaweres, M. Alaydrus, M. Muhaemin, and R.
Sarno, “Performance analysis of VoIP client with integrated
factor for applications requiring both high security and encryption module,” in 2013 1st International Conference on
efficient processing. Communications, Signal Processing, and their Applications
(ICCSPA), Sharjah: IEEE, Feb. 2013, pp. 1–6. doi:
To address these issues, this paper proposes an enhanced 10.1109/ICCSPA.2013.6487300.
AES algorithm for 128-bit key by incorporating chaotic map- [8] M. Ahirrao, B. Pathak, and M. Dixit, “AES and its Multiple
based key generation, dynamic S-Box, reduction in the Modifications for Various Applications,” in 2023 6th International
Conference on Advances in Science and Technology (ICAST),
number of rounds, and additional MixColumn step in the final Mumbai, India: IEEE, Dec. 2023, pp. 476–479. doi:
round to address inherent limitations in standard AES that has 10.1109/ICAST59062.2023.10454951.
been mentioned. The proposed algorithm successfully [9] S. Jayanthy, S. Nageswarvijay, R. K. R. Kumar, and R. K. Kanth,
address those issues in AES algorithm, significantly “Smart Key using AES Algorithm,” in 2021 Third International
Conference on Inventive Research in Computing Applications
enhancing security and complexity against potential (ICIRCA), Coimbatore, India: IEEE, Sep. 2021, pp. 467–473. doi:
cryptographic attacks. 10.1109/ICIRCA51532.2021.9545058.
[10] O. A. Dawood and O. I. Hammadi, “An Analytical Study for Some
Performance evaluation and experimental tests indicate Drawbacks and Weakness Points of the AES Cipher (Rijndael
that the proposed algorithm achieved a higher avalanche score Algorithm),” in Proceeding of 1st International Conference on
and improved encryption time compared to standard AES, Information Technology, Lebanese French University - LFU, Apr.
particularly when handling a larger file. These results suggest 2017, pp. 129–133. doi: 10.25212/ICoIT17.013.
[11] Y. Alemami, M. A. Mohamed, and S. Atiewi, “Advanced approach for
that the modified AES has potential for broader adoption in encryption using advanced encryption standard with chaotic map,” Int.
fields requiring robust data security. J. Electr. Comput. Eng. IJECE, vol. 13, no. 2, p. 1708, Apr. 2023, doi:
10.11591/ijece.v13i2.pp1708-1723.
Future work could focus on exploring the scalability of the [12] M. S. Fadhil, A. K. Farhan, M. N. Fadhil, and N. M. G. Al-Saidi, “A
proposed algorithm for different key sizes of AES algorithm, New Lightweight AES Using a Combination of Chaotic Systems,” in
larger datasets, and further optimizing dynamic S-Box 2020 1st. Information Technology To Enhance e-learning and Other
Application (IT-ELA, Baghdad, Iraq: IEEE, Jul. 2020, pp. 82–88. doi:
generation, as well as rigorous testing across various hardware 10.1109/IT-ELA50150.2020.9253099.
platforms to assess performance consistency. [13] A. E. Adeniyi, K. M. Abiodun, J. B. Awotunde, M. Olagunju, O. S.
Ojo, and N. P. Edet, “Implementation of a block cipher algorithm for
ACKNOWLEDGEMENT medical information security on cloud environment: using modified
This research was funded by Institut Teknologi Sepuluh advanced encryption standard approach,” Multimed. Tools Appl., vol.
82, no. 13, pp. 20537–20551, May 2023, doi: 10.1007/s11042-023-
Nopember (ITS) under Penelitian Kolaborasi Pusat and under 14338-9.
the Project Scheme of the Publication Writing and Intellectual [14] National Institute of Standards and Technology (US), “Advanced
Property Rights (IPR) Incentive (Penulisan Publikasi dan Hak Encryption Standard (AES),” National Institute of Standards and
Kekayaan Intelektual/PPHKI) Program 2024 Technology (U.S.), Washington, D.C., NIST FIPS 197-upd1, May
2023. doi: 10.6028/[Link].197-upd1.
[15] R. B. Naik and U. Singh, “A Review on Applications of Chaotic Maps
REFERENCES in Pseudo-Random Number Generators and Encryption,” Ann. Data
[1] I. Riadi, T. Ahmad, R. Sarno, P. Purwono, and A. Ma’arif, Sci., vol. 11, no. 1, pp. 25–50, Feb. 2024, doi: 10.1007/s40745-021-
“Developing Data Integrity in an Electronic Health Record System 00364-7.
using Blockchain and InterPlanetary File System (Case Study: [16] J. Ryu, D. Kang, and D. Won, “Improved Secure and Efficient
COVID-19 Data),” Emerg. Sci. J., vol. 4, pp. 190–206, Feb. 2022, doi: Chebyshev Chaotic Map-Based User Authentication Scheme,” IEEE
10.28991/esj-2021-SP1-013. Access, vol. 10, pp. 15891–15910, 2022, doi:
[2] F. Afandi and R. Sarno, “Android Application for Advanced Security 10.1109/ACCESS.2022.3149315.
System based on Voice Recognition, Biometric Authentication, and [17] N. A. Ariffin Mohd and A. Y. Ahmed Ashawesh, “Enhanced AES
Internet of Things,” in 2020 International Conference on Smart algorithm based on 14 rounds in securing data and minimizing
Technology and Applications (ICoSTA), Surabaya, Indonesia: IEEE, processing time,” J. Phys. Conf. Ser., vol. 1793, no. 1, p. 012066, Feb.
Feb. 2020, pp. 1–6. doi: 10.1109/ICoSTA48221.2020.1570615292. 2021, doi: 10.1088/1742-6596/1793/1/012066.
[3] K. M. Rajasekharaiah, C. S. Dule, and E. Sudarshan, “Cyber Security [18] R. Verma and A. K. Sharma, “Cryptography: Avalanche effect of AES
Challenges and its Emerging Trends on Latest Technologies,” IOP and RSA,” Int. J. Sci. Res. Publ. IJSRP, vol. 10, no. 4, p. p10013, Apr.
Conf. Ser. Mater. Sci. Eng., vol. 981, no. 2, p. 022062, Dec. 2020, doi: 2020, doi: 10.29322/IJSRP.10.04.2020.p10013.
10.1088/1757-899X/981/2/022062.
[4] D. Kumar Sharma, N. Chidananda Singh, D. A. Noola, A. Nirmal
Doss, and J. Sivakumar, “A review on various cryptographic

Authorized licensed use limited to: Indian Institute of Space Science And Technology. Downloaded on July 02,2025 at 18:08:05 UTC from IEEE Xplore. Restrictions apply.
397