DOI : https://doi.org/10.18517/ijaseit.10.3.10765

A New Method of Data Encryption based on One to One Functions

Osama R Shahin (1), Anis Ben Aissa (2), Yasser Fouad (3), Hassan Al-Mahdi (4), Mansi Alsmarah (5)
(1) Department of Computer Science & Information, Jouf University, Gurayat, Saudi Arabia
(2) Department of Computer Science & Information, Jouf University, Gurayat, Saudi Arabia
(3) Department of Computer Science, Faculty of Computers & Information, Suez University, Suez, Egypt
(4) Department of Computer Science, Faculty of Computers & Informatics, Suez Canal University, Ismailia 41522, Egypt
(5) College of Science & Arts, Jouf University, Gurayat, Saudi Arabia
Fulltext View | Download
How to cite (IJASEIT) :
Shahin, Osama R, et al. “A New Method of Data Encryption Based on One to One Functions”. International Journal on Advanced Science, Engineering and Information Technology, vol. 10, no. 3, June 2020, pp. 1169-75, doi:10.18517/ijaseit.10.3.10765.
Citation Format :
Due to the rapid growth of computer networks, critical highly confidential information shared across these networks. Accordingly, securing such information from unauthorized intruders has become a vital issue in the field of information technology. In this paper, we present a new algorithm for encrypting and decrypting English plain text based on the well-known Caesar's algorithm and a special type of functions called One to One function. The proposed algorithm is referred to as the One to One function algorithm (OtO). The OtO belongs to a symmetric key concept where the same key is used in both encryption and decryption processes. In the OtO algorithm, the triplet (K, a, b) represent the private keys. To speed up the proposed OtO computation, the value of K is calculated based on Fibonacci sequence, on eigenvalues, Leslie matrices and Markov chain. This private key K only knew to the transmitter and receiver and considered one of the private keys used in the encryption process. When the message arrives at the receiver, it uses the inverse function of the proposed one to one function that used at the transmitter. The proposed OtO algorithm is conducted using MATLAB and its efficiency is checked in terms of encrypted time, decrypted time, and Avalanche Effect. We think that the obtained results are acceptable compared to famous algorithms DES, 3DES, AES and RSA. 

S. Jain and V. Bhatnagar, "Analogy of various DNA based security algorithms using cryptography and steganography," (ICICT), 2014 International Conference on, pp 285-291, 2014.

J. Yang, J. Ma, S. Liu, and C. Zhang, "A molecular cryptography model based on structures of DNA self-assembly," Chinese science bulletin, vol 59, no. 11, pp. 1192-1198, 2014.

T. Larrieux, Aurelia. Technical Tools and Designs for Data Protection. In: Designing for Privacy and its Legal Framework. Springer, Cham, 2018. p. 101-148.

J. L. Philjon and N. Venkateshvara, "Metamorphic cryptography—a paradox between cryptography and steganography using dynamic encryption," (ICRTIT), 2011 International Conference on, pp. 217-222. IEEE, 2011.

M. E. Saleh, A. Aly, and F. Omara, “Data security using cryptography and steganography techniques,” (IJACSA) International Journal of Advanced Computer Science and Applications, vol 7.no. 6, 2016.

H. Al-Mahdi, M. Alruily, O. Shahin, & K. Alkhaldi, “Design and Analysis of DNA Encryption and Decryption Technique based on Asymmetric Cryptography System. computing,” vol 10, no. 2, 2019.

K. Chen, "Cryptography. School of Informatics," University of Manchester. pp. 32, 2005.

B. Silva, J. Rodrigues, F. Canelo, M. Lopes, J. Lloret, “Towards a cooperative security system for mobile-health applications,”. Electronic Commerce Research, vol 19, no. 3, pp. 629-654, 2019.

R. Davis, “The Data Encryption Standard in Perspective,” Proceeding of Communication Society magazine, IEEE, vol. 16, Nov 1978.

R.L.Rivest, A.Shamir, L.Adleman, “A Method for obtaining Digital Signatures and Public-Key Cryptosystem,” Communication of the ACM, vol 21, Feb 1978.

P. Chandra Mandal “Superiority of Blowfish Algorithm,” International Journal of Advanced Research in Computers Science and Software Engineering, Vol 2, no. 9, 2012.

G. Singh, A. Kumar, K. S. Sandha, "A Study of New Trends in Blowfish Algorithm," International Journal of Engineering Research and Application. vol. 1, no. 2, pp.321-326, 2011.

J. W. Cornwell, G. A. Columbus, “Blowfish Survey,” Department of Computer Science. Columbus: GA Columbus State University, 2012.

A. Nadeem, M. Y. Javed "A Performance Comparison of Data Encryption Algorithms. In Information and communication technologies," (ICICT), First international conference on IEEE, 2005.

S. M. Seth, R. Mishra, "Comparative Analysis of Encryption Algorithms for Data Communication," 2011.

P. B. Jayant, N. C. Prashant, "Avalanche Effect of AES Algorithm." IJCSIT) International Journal of Computer Science and Information Technologies, vol. 5, no. 3, pp. 3101-3103, 2014.

H. Al-Mahdi O. R. Shahin, Y. Fouad, K. Alkhaldi, “Design and analysis of DNA Binary Cryptography Algorithm for Plaintext,” International Journal of Engineering and Technology (IJET), vol. 10, no. 3 , pp. 699 -706, 2018 .

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
    2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
    3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).