Encryption is based on precise algorithms and specific mathematical operations it is indispensable for the security and safety of information and files that are of great importance in our lives. This paper discusses a new encryption and decryption technique, we used very powerful and complex encryption and decryption algorithms. Our study relies on encrypting the blocks according to the code writing style by making the encryption process for each individual block individually and does not depend on all the blocks that precede it in the message. We focus on sending several messages with different keys. These algorithms will have a high ability to maintain confidentiality and increase the security of information.
Introduction
I. INTRODUCTION
Encryption is the process in which complex algorithms are applied to encrypt messages, data or files so that they can be read only by authorized persons. This ensures the confidentiality of the information. There are many researches in cryptography, for example, (see [1], [2], [3], [5], [7], [10], [14], [16], [17], [21]). The data or information to be encrypted is called plaintext. The plaintext data is then encrypted using various encryption techniques, mathematical calculations, and an encryption key and decryption is the process of repeating the encryption so that previously encrypted information can be viewed or accessed. This involves converting unreadable data (ciphertext) into readable text (plaintext). So, while encryption is the process of making data unreadable, decryption is the process of converting encrypted information into its original and understandable form. The method of encrypting and decrypting information depends on a specific type of encryption key. There are several encryption and decryption algorithms used for security and privacy protection. It is among the most common algorithms:
AES: The AES algorithm is one of the best algorithms used in data encryption, and it is used in many applications such as integrated encryption system, email, and online data storage services, (see [9], [12]).
RSA: It is one of the most prominent algorithms used in general encryption, and is widely used to protect electronic communications, (see [7])
DES: The DES algorithm is a traditional encryption algorithm known for its security, but it is considered simple compared to the security standards used nowadays, (see [8])
Blowfish: A good encryption algorithm that can be used easily, and has a security level similar to the popular AES encryption algorithm, (see [18], [20]).
SHA: They are algorithms for generating indicators based on cryptographic techniques, and they are widely used in security protocols used when logging in and authenticating, (see [13]). In this paper, we discuss a new method of encryption and decryption algorithms that differs from what was mentioned above. Caesar cipher algorithm: It moves the letters of the original text by a specific number of positions in the alphabet, in our method, we relied on a different encoding, similar to the encoding used in papers, [4], [15], with a slight difference, and Hill cipher algorithm, it uses a square matrix to encrypt the original text by converting it into numbers and performing mathematical operations on it ( see [11]), but in this paper our method generally relies on matrixes of the type of column and square matrixes which makes it more complex.
Conclusion
This scientific paper presented the TAS algorithm, a novel and decryption method. By combining the columnar and square matrices techniques, the TAS algorithm achieves increased complexity in the encryption process, subsequently enhancing the security of transmitted data. The implementation of the TAS encryption method has demonstrated its potential as effective tool for secure data communication. The use of columnar and square matrices has added an additional layer of complexity to the encryption algorithm, which enhances its robustness against various cyber threats. The results of this research show that our proposed TAS method provides a significant improvement compared to traditional encryption techniques in terms of encryption accuracy and computational efficiency. Further research and optimization of the algorithm will enable us to harness the full potential of the TAS encryption method and provide more secure communication channels to protect sensitive data from unauthorized access.
References
[1] M. Abobala, “A Short Contribution to Split-Complex Linear Diophantine Equations in Two Variables,” Gal. Jour. of Math. Stru. and App., vol. 6, pp. 32–35, 2023.
[2] M. Alenezi, H. Alabdulazzaq, and N. Mohammed, “Symmetric Encryption Algorithms: Review and Evaluation study,” Int. Jur. of Communication Networks and Inf. Sec., vol. 12, Rep. 256–266, 2020.
[3] W. Al Etaiwi, “Encryption Algorithm Using Graph Theory,” Jur. of Scie. Res. & Reports., vol. 19, pp. 2519–2527, 2014.
[4] S. Aydinyuz, and M. Asci, “Error detection and correction for coding theory on k-order Gaussian Fibonacci matrices,” Math. Bio. and Eng., vol. 20, pp. 1993–2010, 2022.
[5] C. Bennett, G. Brassard, and A. Mouhib, “Quantum Cryptography,” Scientific American. Inc., vol. 267, pp. 50–57, 1992.
[6] D. Boneh, “Twenty years of attacks on the RSA cryptography,” Math. Soc., vol. 46, pp. 203–213, 1999.
[7] Z. Cheddour, A. Chillali, and A. Mouhib, “The “Elliptic” Matrices and a New Kind of Cryptography,” Bol. Soc. Paran. Mat., vol. 41, pp. 1–12, 2023.
[8] D. Coppersmith, “The Data Encryption standard (DES) and its Strength against attacks,” IBM Journal of Research and Development, vol. 38, pp. 243–250, 1994.
[9] J. Daemen, and V. Rijnmen, “The Rijndael Block Cipher, AES proposal, First AES Candidate Conference (AES1),” pp. 20–22, 1998.
[10] W. Diffie, and M.E. Hellman, “New Directions in Cryptography,” IEEE Trans. On Inform., pp. 644–654, 1976.
[11] R. Hasoun, S. Khlebus, and H. Tayyeh, “A New Approach of Classical Hill Cipher in Public Key Cryptography,” Int. Jur. Nonlinear Anal. Appl., vol. 12, pp. 1071–1082, 2021.
[12] T. Ichikawa, T. Kasuya, and M. Matsui, Hardware Evaluation of the AES finalists. The Third Advanced Encryption standard (AES3) Candidate Conference. New York, USA.?, 2000.
[13] B. Islam Khan, R. Olanrewaju, M. Morshidi, R. Mir, M. Kiah, and A. Khan, “Evolution and Analysis of Secure Hash Algorithm (SHA) Family,” Mal. Jur. of Com., vol. 35, pp. 179–200, 2022.
[14] D. Jagadeesh, and M. Krishnaraj, “Cryptographic Interweaving of Messages,” Int. Jur. of Data Informatics and Intelligent computing, vol. 2, pp. 42–50, 2023.
[15] J. Kannan, M. Somanath, M. Mahalakshmi, and K. Raja, “Encryption Decryption Algorithm Using Solutions of Pell Equation,” Int. Jur. Math. And App., vol. 10, pp. 1–8, 2022.
[16] M. Nadeem, A. Arshad, S. Riaz S. Zahra, A. Dutta M. Moteri, and S. Almotairi, “An Efficient Technique to Prevent Data Misuse with Matrix Cipher Encryption Algorithms,” Computers, Materials & Continua, vol. 74, pp. 4059–4079, 2023.
[17] R.L. Rivest, A. Shamir, and L.M. Adleman, A method for obtaining digital signatures and public-key cryptosystems” Communications of the ACM. Ideas that created the future Ideas: Classic Papers of Computer Science, Harry R. Lewis, 1978.
[18] B. Schneier, “Description of a New Variable- Length Key, 64-Bit Block Cipher (Blowfish). Fast Software Encryption,” Cambridge Security Workshop Proceedings, vol. 21, pp. 191–204, 1994.
[19] R. Srinivasa, K. Upendrarao, and CH. Krishna Prasad, “A study of encryption algorithm (RSA, DES, 3DES and AES) for information security,” Turk. J. of Comp. and Math. Educ. (TURCOMAT), vol. 11, pp. 1871–1876, 2020.
[20] N. Valmik, “Blowfish Algorithm,” Int. Jur. of Eng. Sci. & Man. Res., vol. 10, pp. 45–48, 2015.
[21] T. Veena, “Encryption and Decryption of Messages by Using Matrices,” Int. Jur. of Sci. Res. in Modern Science and Technology, vol. 2, pp. 1–7, 2023.
[22] S. Abo Izaiah, and T. Al Bolati, “Coding and Decoding Algorithms Using Jacobethan-Lucas numbers,” Alqala J, vol. 20, pp. 19–28, 2023.