Research Article Open Access

Performance Analysis of Two Famous Cryptographic Algorithms on Mixed Data

Emmanuel Abidemi Adeniyi1,2,3, Agbotiname Lucky Imoize4,5, Joseph Bamidele Awotunde6, Cheng-Chi Lee7,8, Peace Falola1,2,3, Rasheed Gbenga Jimoh6 and Sunday Adeola Ajagbe9
  • 1 Department of Computer Sciences, Precious Cornerstone University, Ibadan, Oyo State, Nigeria
  • 2 PUCRID Center, SDG 9 (Industry, Innovation, and Infrastructure Research Group), Precious Cornerstone University, Ibadan, Oyo State, Nigeria
  • 3 PUCRID Center, SDG 4 (Quality Education), Precious Cornerstone University, Ibadan, Oyo State, Nigeria
  • 4 Department of Electrical and Electronics Engineering, Faculty of Engineering, University of Lagos, Akoka, Lagos 100213, Nigeria
  • 5 Department of Electrical Engineering and Information Technology, Institute of Digital Communication, Ruhr University, 44801 Bochum, Germany
  • 6 Department of Computer Science, Faculty of Information and Communication Sciences, University of Ilorin, Ilorin 240003, Nigeria
  • 7 Department of Library and Information Science, Fu Jen Catholic University, New Taipei City 24205, Taiwan
  • 8 Department of Computer Science and Information Engineering, Asia University, Taichung City 41354, Taiwan
  • 9 Department of Computer and Industrial Production Engineering, First Technical University, Ibadan, 200255, Nigeria

Abstract

The rapid development of digital data sharing has made information security a crucial concern in data communication. The information security system heavily relies on encryption methods. These algorithms employ strategies to increase data secrecy and privacy by obscuring the information, which only those parties who have the accompanying key can decode or decrypt. Nevertheless, these methods also use a lot of computational resources, including battery life, memory, and CPU time. So, to determine the optimal algorithm to utilize moving forward, it is necessary to assess the performance of various cryptographic algorithms. Therefore, this study evaluates two well-known cryptographies (RSA and ElGamal) using mixed data such as binary, text, and image files. CPU internal clock was used to obtain the time complexity used by both algorithms during encryption and decryption. The algorithms used CPU internal memory to obtain memory usage during the encryption and decryption of mixed data. Evaluation criteria such as encryption time, decryption time, and throughput were used to compare these encryption algorithms. The response time, confidentiality, bandwidth, and integrity are all factors in the cryptography approach. The results revealed that RSA is a time-efficient and resourceful model, while the ElGamal algorithm is a memory-efficient and resourceful model.

Journal of Computer Science
Volume 19 No. 6, 2023, 694-706

DOI: https://doi.org/10.3844/jcssp.2023.694.706

Submitted On: 1 February 2023 Published On: 29 May 2023

How to Cite: Adeniyi, E. A., Imoize, A. L., Awotunde, J. B., Lee, C., Falola, P., Jimoh, R. G. & Ajagbe, S. A. (2023). Performance Analysis of Two Famous Cryptographic Algorithms on Mixed Data. Journal of Computer Science, 19(6), 694-706. https://doi.org/10.3844/jcssp.2023.694.706

  • 1,053 Views
  • 772 Downloads
  • 0 Citations

Download

Keywords

  • Cryptographic Algorithms
  • Asymmetric Encryption
  • RSA
  • ElGamal
  • Complexity