A combination of hill cipher and RC4 methods for text security

Abstract

To hide confidential messages from people who are not responsible or who can access the messages, a way is needed to hide the messages. One way to hide messages in transmission is to change the data into something unintelligible by encoding and embedding it using cryptography and steganography techniques. This application was built using the hill cipher algorithm and the Rivest Cipher 4 (RC4) method. This algorithm is a symmetric key algorithm which has several advantages in data encryption. The hill chiper algorithm uses a mxm matrix as the encryption and decryption key. Meanwhile, the RC4 symmetric key is in the form of a stream cipher which can process input data as well as messages or information. Input data is generally in the form of bytes or even bits. The results of this research show that hill cipher and RC4 have their respective advantages and disadvantages. However, currently, RC4 is generally considered less safe for use in security-critical scenarios due to its vulnerability to attack. It is highly recommended to use an encryption algorithm such as advanced encryption standard (AES) which is modern and strong and has been tested and proven to be more resilient.

Headnote

Keywords:

Combination

Data security

Hill chiper

Rivest Cipher

Rivest Cipher 4

ABSTRACT

To hide confidential messages from people who are not responsible or who can access the messages, a way is needed to hide the messages. One way to hide messages in transmission is to change the data into something unintelligible by encoding and embedding it using cryptography and steganography techniques. This application was built using the hill cipher algorithm and the Rivest Cipher 4 (RC4) method. This algorithm is a symmetric key algorithm which has several advantages in data encryption. The hill chiper algorithm uses a mxm matrix as the encryption and decryption key. Meanwhile, the RC4 symmetric key is in the form of a stream cipher which can process input data as well as messages or information. Input data is generally in the form of bytes or even bits. The results of this research show that hill cipher and RC4 have their respective advantages and disadvantages. However, currently, RC4 is generally considered less safe for use in security-critical scenarios due to its vulnerability to attack. It is highly recommended to use an encryption algorithm such as advanced encryption standard (AES) which is modern and strong and has been tested and proven to be more resilient.

(ProQuest: ... denotes formulae omitted.)

1. INTRODUCTION

Security issues are an important aspect in sending data and information over the network [1]. This is due to computer networks with an open system concept that can make it easier for someone to enter the network, which can result in the process of sending data being insecure and can be used by people or other parties who are not responsible for taking information in the middle of the road. One way to maintain the security of confidential data or information is to use cryptography [2]. Cryptography is an encryption technique in which "original text" (plaintext) can be scrambled using an encryption key to become "random text that is hard to read" (ciphertext) [3]-[5]. Cryptography has many methods, namely hill cipher and Rivest Cipher 4 (RC4) [6]-[8]. Hill cipher is a symmetric key cryptographic algorithm that has several advantages in data encryption [9]. To avoid invertible key matrices, key matrices are generated using newton's binomial coefficients [10], [11]. The encryption and description process uses the same key, plaintext can use image or text media. RC4 is a stream cipher type so that it can process units or input data, messages or information. The unit or data is generally a byte or sometimes even a bit (a byte in the case of RC4) so that in this way the encryption or decryption can be carried out at variable lengths.

Cryptography is the science of encryption techniques where data is scrambled using an encryption key to be something that is difficult to read someone who doesn't have the decryption key. Decryption using the decryption key gets back the original data. The encryption process is carried out using an algorithm with several parameters. Encryption that relies on the secrecy of the algorithm is considered something that is not good. The secret lies in the several parameters used. It is the parameter that determines the decryption key that must be kept secret. Cryptography is a security method for protecting information by using passwords that can only be understood by people who have the right to access the information. Cryptography is the only method used to protect information through communication networks that use landlines, communication satellites, and microwave facilities. Cryptography is a science that studies mathematical techniques related to aspects of information security such as confidentiality, data integrity, and authentication of data senders/recipients. Cryptography is an art or science to maintain the confidentiality of a text so that it remains safe without being noticed by unauthorized parties. But now cryptography is not just art or secrecy but also integrity, authentication, and data validity.

2. CRYPTOGRAPHIC WORK SYSTEM

In general, cryptography is the practice and study of techniques for securing communication and data from third parties. Cryptographic systems are employed in various areas such as securing communication over the internet, protecting sensitive information, ensuring the integrity of data, and more. The keys that can be used for encryption and decryption need not be identical, depending on the system used [12], [13]. Mathematically the process of encryption and decryption can be written:

EK (M): C (encryption process)

DK (C): M (decryption process)

Where E: (encryption process)

K: key

M: original message

C: encrypted text

D: decryption process

During the encryption process, the message (M) will be coupled using the encryption key (K) to a password that cannot be understood (C) [14], [15]. While in the decryption process, the password that is not understood (C) will be deciphered using the decryption keyword (K) so that it can produce the same message (M) as the previous message. The fundamental functions in cryptography are encryption and decryption [16], [17].

a. Encryption

Encryption is the process of changing an original message (plaintext) into a message in coded language (ciphertext) [18], [19]. Encryption is part of cryptography and is very important so that the security of the data sent can be kept confidential [20]. Encryption can be interpreted as a cipher or code, where the original message (plaintext) is converted into separate codes according to the method agreed upon by the message and the recipient of the message. C = E(M) where C=message in coded language (ciphertext), E=encryption process, and M=original message (plaintext). Figure 1 describes both the encryption process and the decryption process.

b. Decryption

Decryption is the process of changing messages in a coded language (ciphertext) into original messages (plaintext) [21], [22]. Decryption is the reverse process of encryption which returns the passwords or information that has been traced to the original file form by using a key or code. M = D (C) where M=original message (plaintext), D=decryption process, and C message in coded language (ciphertext). In addition to using certain functions for encryption and decryption, these functions are often given additional parameters called keys.

Cryptographic algorithms can also be called ciphers, namely the rules for encrypting and decoding, or the functions used for encryption and decryption. The security of cryptographic algorithms is often measured by the amount of work required to break ciphertext into plaintext without knowing the key used. If the more processes needed mean the longer it takes, the stronger the algorithm is and the more secure it is used to encode messages. In cryptography there are various cryptographic algorithms based on the key, namely symmetric algorithms, asymmetric algorithms, hill cipher algorithms, and RC4 algorithms.

c. Symmetric algorithm

This algorithm is also often called the classical algorithm because it uses the same key for encryption and decryption [23]. To send messages using this algorithm, the recipient must be informed of the key to the message so that it can decrypt the message to be sent. In Figure 2, it explains the security of messages using this algorithm depending on the key, if the key is known by someone else then that person can encrypt and decrypt the message.

d. Asymmetric algorithm

Asymmetric cryptography algorithms are algorithms that use different keys for the encryption and decryption processes [24]. Figure 3 explains the asymmetric cryptography algorithm, also known as the public key algorithm, because the key for encryption is public (public key) or can be known by everyone, but the key for decryption can only be known by authorized people who know it with the encoded data. Or often called private key.

e. Hill cipher algorithm

Hill cipher is an application of modulo arithmetic to cryptograph [25]. This technique uses a square matrix as a key that can be used to perform encryption and decryption. Hill cipher cryptography does not replace every other letter that is the same in the ciphertext because it uses matrix multiplication based on encryption and description. Hill cipher is a polyalphabetic cipher which can be categorized as a block cipher because the selected text will be processed and divided into blocks of a certain size. Each character has a block that can influence other characters in the encryption and decryption process, so that the same character is not differentiated into the same character. The hill cipher was created by Lester S. Hill in 1929. The hill cipher does not replace every letter that is the same in plaintext with another alphabet in the ciphertext, because hill cipher uses matrix multiplication in its encryption and description. Hill cipher is a vulnerable symmetric encryption algorithm against known-plaintext attacks. If cryptanalysis can collect plaintext and ciphertext with the same key, then cryptanalysis can find out the key from hill.

f. RC4 stream algorithm

The RC4 algorithm is a symmetric key in the form of a stream cipher that can process input data or messages or information [26]. Input data is generally a byte or even bits. In this algorithm you don't have to wait for a certain amount of input data or information to add bytes to encrypt. The RC4 algorithm has two S-boxes, namely, an array of length 256 which contains permutations from 0 to 255, and the second S-box is a function of keys with variable lengths. The way the RC4 algorithm works is to initialize the first S-box array, S[0], S[1] ,...., S[255], with numbers 0 to 255. Fill in the first thing sequentially S[0]=0, S[1]=1 ,..., S[255]=255. Whereas the second S-box is for example an array K with a length of 256. An array of K with keys that can be repeated until the entire array is K[0], K[1] ,..., K[255] is completely filled. In general, in the encryption-decryption process, there are two types of ciphers based on how the encoding works, namely a stream cipher is a system where the encryption and decryption process are done bit by bit. In this system the key bit stream is generated by a random bit generator. This key stream is subjected to an XOR operation with a stream of plaintext bits to produce a stream of ciphertext bits.

3. RESULTS AND DISCUSSION

In a system required an analysis of the system to be designed. This study uses observation of data security by using a database and using the hill cipher and RC4 cryptographic systems. Hill cipher is a software that is used to secure data. The way the hill cipher works is quite simple and easy to understand so that it determines the security level of a cipher so that it cannot be dismantled. Meanwhile, RC4 is a byte-oriented stream cipher system, then it performs XOR operations with a byte key by generating cipher bytes.

a. Hill cipher cryptography

1) Encryption process on hill cipher

Hill cipher is a symmetric key algorithm that falls under the category of polygraphic substitution ciphers. It operates on blocks of plaintext, typically groups of two or three letters. The key for the hill cipher is a matrix. Cryptographic analysis using the 3×3 hill cipher encryption method is as:

Plaintext: "HARIMAUSUMATERA"

Key: "O R A N G U T A N"

If there is Plaintext "HARIMAUSUMATERA" and the key "ORANGUTAN" then it must be converted first to:

Plaintext: "7 0 17 8 12 0 20 18 20 12 0 19 4 17 0"

Key: "141701362019013"

From the plaintext it can be added to the key K through the:

...

The encryption characters corresponding to 7, 0, and 17 are U, P and Q. Then the HAR characters in the plaintext change to the U P Q characters in the ciphertext. The third and fourth characters have the result of calculating numbers that do not correspond to the letters, so they must be modulo 26 in the result.

...

Applying the encryption process to the original text (plain text) "HARIMAUSUMATRA" using the hill cipher method, obtains an encrypted text (ciphertext) which reads "UPQEUWOOQMQHHYY". The hill cipher method uses linear algebra principles to convert blocks of text into blocks of encrypted text, producing a ciphertext that does not show any obvious or easily recognizable patterns from the original text.

2) Decryption process on hill cipher

To carry out cryptographic analysis and decrypt messages that have been encrypted using the hill cipher method, the first step is to change the encryption key in the form of the word "ORANGUTAN" into a series of numbers according to the position of the letters in it, where A=0, B=1, ..., Z = 25. The key "ORANGUTAN" is converted into a set of numbers K= (14,17,0,13,6,20,19, 0, 13), based on the alphabet.

...

In proving the inverse of matrix K with inverse K-1, the proof step is carried out by performing a multiplication operation between matrix K and its inverse, namely K-1. The goal of this step is to ensure that the multiplication produces an identity matrix. The success of producing the identity matrix after the multiplication operation is proof of the validity that K-1 is the appropriate inverse for the K matrix, thus reaffirming the truth of the inverse relationship between the two, the proof is as:

...

In the context of information security, the process of decrypting an encrypted note or data requires the initial step, namely changing the ciphertext that has been generated during the encryption process. The process of decrypting the record must first change the ciphertext C = "UPQEUWOOQMQHHYY" to letters in numerical sequence C = "20 15 16 4 20 22 14 14 16 12 16 7 7 24 24".

First record:

...

Second record:

...

After all records have been decrypted, the plaintext results are obtained: C = "20 15 16 4 20 22 14 14 16 12 16 7 7 24 24" P = "HARIMAUSUMATERA".

b. Cryptography RC4

RC4 is a type of symmetric stream cipher encryption that has been widely used in various applications to secure data transmission. To understand how RC4 works, use a case example by taking the text "TIGER" as the data you want to encrypt, and using "LEUSER" as the encryption key. RC4 encrypts this data into a ciphertext that cannot be read without the appropriate key.

In Table 1 there are the results of cryptographic analysis carried out using the RC4 algorithm. This algorithm has been implemented to secure data by generating random keys that are used in the encryption process. The analysis includes an evaluation of the performance of the algorithm, the strength of the encryption provided, and the possible vulnerability to cryptanalysis attacks.

1) Initialize an S-box with a length of 256 bytes, with S[0]=0, S[1]=1, S[2]=2, S[3]=3,....., S[255] =255 so array S becomes:

2) Initialize the 7-byte Ki array key, for example the key consists of 7 bytes namely "LEUSER" then the sentence to be converted into decimal form "76 69 85 83 69 82". Repeat the key until it fills the entire K array so that the K array becomes something different, as shown in Table 2.

3) Next mixes the operation which will apply variables i and j to the index array S[i] and K[i]. The first step is initialized for i and j with 0. The mixing operation is repeating the formula (j + S[i] + K[i]) mod 256 followed by swapping S[i] for S[j]. Because it uses an array with a length of 256 bytes the algorithm becomes:

...

Iterations are carried out to perfect each step in the process, while S-box exchange (swap) becomes a key strategy in increasing resistance to possible attacks. After carrying out iterations from 0 to 255 iterations and S-box exchanges, the results obtained after carrying out all iterations from 0 to 255 iterations and S-box exchanges (swaps) are shown in Table 3. RC4 encryption is an encryption process that is XORing bytes with the plaintext "HARIMAU". Plaintext consists of 7 characters, so 7 iterations occur. The previous iteration must be converted into binary form as shown in Table 4.

...

In the initial step of the algorithm, the initial values of variables i and j are initialized as 0. This initialization is a critical step that prepares the algorithm's iterative process for key setting and data randomization. Initialize i and j with i = 0; j = 0.

...

By performing seven iterations using the "TIGER" key, the results were recorded and presented in Table 5. This table provides a detailed description of the key changes after each iteration, showing sequential data transformations. After successfully finding the key for each character, the next step is the XOR operation between the character in the plaintext and the key that has been generated. This process is an integral part of the encryption algorithm, where XOR is used to combine information from both sources and produce a ciphertext that cannot be easily reconstructed without knowing the correct key. The resulting key is as shown in Table 6.

The decryption process is XORing pseudorandom bytes with the ciphertext being % C? - y ȁ - . Ciphertext consists of 7 iterations which will be converted into characters in the form of binary numbers as in the data contained in Table 7.

4. CONCLUSION

Hill cipher is a cryptographic substitution encryption method that works with matrices. This method converts bright text letter blocks into cipher letter blocks using the key matrix. This method is capable of encrypting messages in block form, so it can overcome some of the vulnerabilities in the simple substitution method. This method is more powerful than the simple substitution method because the correlations between letters are not clearly visible in encrypted text. RC4 is a cryptographic flow algorithm that uses a key to generate a stream of random bytes, which are used to encrypt messages. RC4 is an algorithm that is fast enough to perform encryption and decryption. and this algorithm is relatively easy to understand and implement. Both hill cipher and RC4 have their own strengths and weaknesses. However, at this time, RC4 is generally considered less secure for use in security-critical scenarios because of its vulnerability to attacks. In practice, for higher data security, it is recommended to use modern and stronger encryption algorithms such as advanced encryption standard (AES) which has been tested and proven to be more robust against modern attacks.

Sidebar

Article Info

Article history:

Received Aug 21, 2023

Revised Dec 22, 2023

Accepted Jan 12, 2024

Corresponding Author:

Azanuddin

Department of Computer Engineering, Faculty of Computer Engineering and Informatics

Politeknik Negeri Medan

Jl. Alamamater No. 1 Padang Bulan, Medan, Indonesia

Email: [email protected]

BIOGRAPHIES OF AUTHORS

Azanuddin ···· is a lecturer at the Computer Engineering Department of Computer Engineering and Informatics, Medan State Polytechnic, Indonesia since 2022, before is lacturer at the Budi Darma University and STMIK Triguna Dharma since 2013-2022. He received her S.Kom in Informatics Engineering from Budi Darma University, Indonesia in 2011 and his M.Kom degree in Computer Science from Putra Indonesia YPTK Padang University Indoneisa in 2013. His research interests include network security, data security, encryption and decryption algorithms, mobile programming, and cloud computing. He can be contacted at email: [email protected].

Rikie Kartadie ···· he received his Master of Computer Science from Universiti Amikom Yogyakarta (2014). Now a lecturer in Computer Science at the Information Systems Study Program, now a lecturer at the Department of Computer Engineering, Universitas Technologi Digital Indonesia. In addition, he also has an assessment of the national professional certification agency, computer network competence, he has a professional lecturer certification from the Ministry of Research, Technology, and Higher Education. In 2018 he was assigned by the Ministry of Education, Culture, Research and Technology as a lecturer workload assessor. He is also one of the reviewers of the SINTA 3, 4 indexed national journals. He has published more than 35 journal papers, 1 written book, and 1 journal scopus paper. His research interests are networking, artificial intelligence, internet of thing, and data mining. He can be contacted at email: [email protected].

Fauzi Erwis ···· currently working on Doctorate (Doctorate in Vocational Technology Education) at the Faculty of Engineering from Padang State University starting in 2020. He is a lecturer in Information Technology Education Universitas Rokania, Rokan Hulu, Indonesia. He was head lectures at Information Technology Education from 2019 to 2020. His research interests are decision support systems, artificial intelligence, and expert system. He can be contacted at email: [email protected].

Ahmad Fitri Boy ···· he earned a postgraduate degree in the Faculty of Computer Science from UPI (Universitas Putera Indonesia) YPTK Padang in 2009. He is a Computer Science lecturer in Information Systems at the STMIK Triguna Dharma Institute, Medan, Indonesia. In addition, he also served as head of the Informatics Management Program and Deputy Chair III of the Institute at STMIK Triguna Dharma from 2017 to 2022. Since 2018, he has a professional lecturer certification from the Ministry of Research, Technology and Higher Education. He has published more than 10 journal papers, 2 HKI, and 2 papers in conference proceedings. His research interests are decision support systems, artificial intelligence, and data mining. He can be contacted via email: [email protected].

Asyahri Hadi Nasyuha ···· he received his Doctorate (Doctorate in Vocational Technology Education) at the Faculty of Engineering from Padang State University in 2020. He is a lecturer in Computer Science at the Information Systems Study Program, Universitas Teknologi Digital Indonesia, Yogyakarta, Indonesia. In addition, he has also served as head of the Quality Assurance Institute at STMIK Triguna Dharma from 2020 to 2022. Since 2019, he has a professional lecturer certification from the Ministry of Research, Technology and Higher Education. In 2021 he was assigned by the Ministry of Education, Culture, Research and Technology as a lecturer workload assessor. In 2022, he will graduate as an assessor for the independent accreditation agency INFOKOM. He is also one of the reviewers of the SINTA 3 indexed national journal. He has published more than 100 articles in national and international journals, 3 books, 2 intellectual property rights and several articles in conference proceedings. His research interests are decision support systems, artificial intelligence, and data mining. He can be contacted at email: [email protected].

References

REFERENCES

[1] V. Adat and B. B. Gupta, "Security in Internet of Things: issues, challenges, taxonomy, and architecture," Telecommunication Systems, vol. 67, no. 3, pp. 423-441, 2018, doi: 10.1007/s11235-017-0345-9.

[2] S. Ghoul, R. Sulaiman, and Z. Shukur, "A Review on Security Techniques in Image Steganography," International Journal of Advanced Computer Science and Applications, vol. 14, no. 6, pp. 361-385, 2023, doi: 10.14569/IJACSA.2023.0140640.

[3] C. Gong et al., "Grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing," Quantum Information Processing, vol. 19, no. 3, p. 105, Mar. 2020, doi: 10.1007/s11128-020-2603-0.

[4] H. Y. Lin and Y. R. Jiang, "A multi-user ciphertext policy attribute-based encryption scheme with keyword search for medical cloud system," Applied Sciences (Switzerland), vol. 11, no. 1, pp. 1-14, Dec. 2021, doi: 10.3390/app11010063.

[5] S. Y. Wulandari, "Cryptography: A Combination of Caesar and Affine Cipher to Conceal the Message," Proceeding International Conference on Science and Engineering, vol. 3, pp. 741-744, Apr. 2020, doi: 10.14421/icse.v3.595.

[6] K. Prasad and H. Mahato, "Cryptography using generalized Fibonacci matrices with Affine-Hill cipher," Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 8, pp. 2341-2352, Nov. 2022, doi: 10.1080/09720529.2020.1838744.

[7] R. K. Hasoun, S. F. Khlebus, and H. K. Tayyeh, "A new approach of classical hill cipher in public key cryptography," International Journal of Nonlinear Analysis and Applications, vol. 12, no. 2, pp. 1071-1082, 2021, doi: 10.22075/ijnaa.2021.5176.

[8] H. Touil, N. E. L. Akkad, and K. Satori, "Text Encryption: Hybrid cryptographic method using Vigenere and Hill Ciphers.," in 2020 International Conference on Intelligent Systems and Computer Vision, ISCV 2020, IEEE, Jun. 2020, pp. 1-6, doi: 10.1109/ISCV49265.2020.9204095.

[9] Nurhayati, A. Meizar, F. Tambunan, and E. Ginting, "Optimizing the Complexity of Time in the Process of Multiplying Matrices in the Hill Cipher Algorithm Using the Strassen Algorithm," in 2019 7th International Conference on Cyber and IT Service Management, CITSM 2019, IEEE, Nov. 2019, pp. 1-4, doi: 10.1109/CITSM47753.2019.8965416.

[10] N. Aragon, P. Gaborit, A. Hauteville, O. Ruatta, and G. Zemor, "Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography," IEEE Transactions on Information Theory, vol. 65, no. 12, pp. 7697-7717, Dec. 2019, doi: 10.1109/TIT.2019.2933535.

[11] F. Pitolli, "A fractional b-spline collocation method for the numerical solution of fractional predator-prey models," Fractal and Fractional, vol. 2, no. 1, pp. 1-16, Feb. 2018, doi: 10.3390/fractalfract2010013.

[12] C. L. Chowdhary, P. V. Patel, K. J. Kathrotia, M. Attique, P. Kumaresan, and M. F. Ijaz, "Analytical study of hybrid techniques for image encryption and decryption," Sensors (Switzerland), vol. 20, no. 18, pp. 1-19, Sep. 2020, doi: 10.3390/s20185162.

[13] Y. Zhang, "The unified image encryption algorithm based on chaos and cubic S-box," Information Sciences, vol. 450, pp. 361-377, Jun. 2018, doi: 10.1016/j.ins.2018.03.055.

[14] L. Teng, X. Wang, and J. Meng, "A chaotic color image encryption using integrated bit-level permutation," Multimedia Tools and Applications, vol. 77, no. 6, pp. 6883-6896, Mar. 2018, doi: 10.1007/s11042-017-4605-1.

[15] Y. Luo, X. Ouyang, J. Liu, and L. Cao, "An Image Encryption Method Based on Elliptic Curve Elgamal Encryption and Chaotic Systems," IEEE Access, vol. 7, pp. 38507-38522, 2019, doi: 10.1109/ACCESS.2019.2906052.

[16] D. Liestyowati, "Public Key Cryptography," Journal of Physics: Conference Series, vol. 1477, no. 5, p. 052062, Mar. 2020, doi: 10.1088/1742-6596/1477/5/052062.

[17] A. A. Yazdeen, S. R. M. Zeebaree, M. M. Sadeeq, S. F. Kak, O. M. Ahmed, and R. R. Zebari, "FPGA Implementations for Data Encryption and Decryption via Concurrent and Parallel Computation: A Review," Qubahan Academic Journal, vol. 1, no. 2, pp. 8- 16, Mar. 2021, doi: 10.48161/qaj.v1n2a38.

[18] M. S. Novelan, A. M. Husein, M. Harahap, and S. Aisyah, "SMS Security System on Mobile Devices Using Tiny Encryption Algorithm," Journal of Physics: Conference Series, vol. 1007, no. 1, p. 012037, Apr. 2018, doi: 10.1088/1742-6596/1007/1/012037.

[19] O. Laia, E. M. Zamzami, Sutarman, F. G. N. Larosa, and A. Gea, "Application of Linear Congruent Generator in Affine Cipher Algorithm to Produce Dynamic Encryption," Journal of Physics: Conference Series, vol. 1361, no. 1, p. 012001, Nov. 2019, doi: 10.1088/1742-6596/1361/1/012001.

[20] R. Hamza, Z. Yan, K. Muhammad, P. Bellavista, and F. Titouna, "A privacy-preserving cryptosystem for IoT E-healthcare," Information Sciences, vol. 527, pp. 493-510, Jul. 2020, doi: 10.1016/j.ins.2019.01.070.

[21] J. Shen, H. Ji, and J. Han, "Near-imperceptible neural linguistic steganography via self-adjusting arithmetic coding," in EMNLP 2020 - 2020 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference, Stroudsburg, PA, USA: Association for Computational Linguistics, 2020, pp. 303-313, doi: 10.18653/v1/2020.emnlp-main.22.

[22] M. Alruily, O. R. Shahin, H. Al-Mahdi, and A. I. Taloba, "Asymmetric DNA encryption and decryption technique for Arabic plaintext," Journal of Ambient Intelligence and Humanized Computing, Apr. 2021, doi: 10.1007/s12652-021-03108-w.

[23] E. Osaba, J. D. Ser, A. Sadollah, M. N. Bilbao, and D. Camacho, "A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem," Applied SoftComputing Journal, vol. 71, pp. 277-290, Oct. 2018, doi: 10.1016/j.asoc.2018.06.047.

[24] M. A. Al-Shabi, "A Survey on Symmetric and Asymmetric Cryptography Algorithms in information Security," International Journal of Scientific and Research Publications (IJSRP), vol. 9, no. 3, p. p8779, Mar. 2019, doi: 10.29322/ijsrp.9.03.2019.p8779.

[25] J. R. Paragas, A. M. Sison, and R. P. Medina, "Hill cipher modification: A simplified approach," in 2019 IEEE 11th International Conference on Communication Software and Networks, ICCSN 2019, IEEE, Jun. 2019, pp. 821-825, doi: 10.1109/ICCSN.2019.8905360.

[26] E. J. Madarro-Capó, C. M. Legón-Pérez, O. Rojas, and G. Sosa-Gómez, "Measuring avalanche properties on RC4 stream cipher variants," Applied Sciences (Switzerland), vol. 11, no. 20, p. 9646, Oct. 2021, doi: 10.3390/app11209646.