Main Article Content
The technological development in the field of information and communication has been accompanied by the emergence of security challenges related to the transmission of information. Encryption is a good solution. An encryption process is one of the traditional methods to protect the plain text, by converting it into inarticulate form. Encryption implemented can be occurred by using some substitute techniques, shifting techniques, or mathematical operations. This paper proposed a method with two branches to encrypt text. The first branch is a new mathematical model to create and exchange keys, the proposed key exchange method is the development of Diffie-Hellman. It is a new mathematical operations model to exchange keys based on prime numbers and the possibility of using integer numbers. While the second branch of the proposal is the multi-key encryption algorithm. The current algorithm provides the ability to use more than two keys. Keys can be any kind of integer number (at least the last key is a prime number), not necessarily to be of the same length. The Encryption process is based on converting the text characters to suggested integer numbers, and these numbers are converted to other numbers by using a multilevel mathematical model many times (a multilevel process depending on the number of keys used), while the decryption process is a one-level process using just one key as the main key, while the other keys used as secondary keys. The messages are encoded before encryption (coded by ASCII or any suggested system). The algorithm can use an unlimited number of keys with a very large size (more than 7500 bytes), at least one of them a prime number. Exponentiation is also used for keys to increase complexity. The experiments proved the robustness of the key exchange protocol and the encryption algorithm in addition to the security. Comparing the suggested method with other methods ensures that the suggested method is more secure and flexible and easy to implement.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Nentawe Y. Goshwe. Data encryption, and decryption using RSA algorithm in a network environment. IJCSNS. 2013; 13(7): 9-13.
Adil J Z, Momeen K. General Summary Cryptography. Int J Eng Res Appl. 2018; 8(2): 68-71: DOI: 10.9790/9622-080206871.
Kumari S. A research paper on cryptography encryption and compression techniques. IJECS. 2017; 6(4): 20915-9: DOI: 10.18535/ijecs/v6i4.20.
Nidhal K. El Abbadi, Abaas S T, Abd Alaziz A. New image encryption algorithm based on Diffie-Hellman and singular value decomposition. IJARCCE. 2016; 5(1): 197-201: DOI 10.17148/IJARCCE.2016.5147.
Abdullah M J, Azman S. A New public-key encryption scheme based on non-expansion visual cryptography and Boolean operation. IJCSI. 2010; 7(4): 1-10.
Mahajan P, Sachdeva A. A Study of encryption algorithms AES, DES, and RSA for security. GJCST, Web & Security. 2013; XIII(XV): 15-22.
Tumati G, Rajesh Y, Manogna T, Ram K J. A New Encryption Algorithm Using Symmetric Key Cryptography. IJET. 2018; 7(2.32): 436 –8: DOI: 10.14419/ijet.v7i2.32.15734.
Sowmiya M, Prabavathi S. Symmetric and Asymmetric Encryption Algorithms in Cryptography. Int J Recent Technol Eng. 2019; 8(1S2): 355-7.
Almeida J. Asymmetric cryptography using shadow numbers. US Patent 8811606 B2, 2014;
David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green, et. al. Imperfect forward secrecy: How Diffie-Hellman Fails in practice. (CACM) Communications of the ACM. 2019; 62(1): 106-14: DOI: http://dx.doi.org/10.1145/3292035.
Gupta H, Sharma V. K. Multiphase encryption: A New concept in modern cryptography. Int. J. Comput. Theory Eng. 2013; 5(4): 638-40: DOI: 10.7763/IJCTE.2013.V5.765.
Omar G A, Shawkat G. A Survey on Cryptography Algorithms. IJSRP. 2018; 8(7): 495-516: DOI: 10.29322/IJSRP.8.7.2018.p7978.
Al-Hazaimeh O. A New approach for complex encrypting and decrypting data. IJCNC. 2013; 5(2): 95-103: DOI: 10. 5121/ijcnc.2013.5208.
Mushtaq MF, Jamel S, Disina AH, Pindar ZA, Shakir NS, Deris MM. A Survey on the Cryptographic Encryption Algorithms. IJACSA. 2017; 8(11): 333-44.
Mahalakshmi J, Kuppusamy K. Hybridization of ICBC and Genetic Algorithm for Optimizing Encryption Process in Cloud Computing Application Service. Fundam. Inform. 2018; 157 (1-2): 79–109: DOI 10.3233/FI-2018-1619.
Popli M. DNA Cryptography: A Novel Approach for Data Security Using Flower Pollination Algorithm, Proceedings of International Conference on Sustainable Computing in Science, Technology and Management, Amity University Rajasthan, India. 2019; 26(28): 2069-76
Lipinski Z. Symmetric and Asymmetric cryptographic key exchange protocols in the octonion algebra. Springer. AAECC. 2021; 32:81–96; DOI.org/10.1007/s00200-019-00402-1.
Mokhtarnameh R, Muthuvelu N, Ho SB, Chai I. A Comparison Study on Key Exchange-Authentication protocol. Int. J. Comput. Appl. 2010 Sep;7(5):5-11.DOI:10.5120/1161-1459.
Thirupalu U, Kesavulu R E. Performance Analysis of Cryptographic Algorithms in the Information Security. IJERT. NCISIOT - 2019 Conference Proceedings. 2019; 8(2): 64-9.