Blockchain Technology Performance of Asymmetric Algorithms: An Empirical Study

Authors

  • Mujeeb-ur-Rehman Jamali University of Sindh, Jamshoro Sindh Pakistan
  • Dr. Najma Nawaz Channa Institute of Mathematics and Computer Science, Jamshoro, Sindh
  • Aadil Jamali Institute of Mathematics and Computer Science, Jamshoro, Sindh, Pakistan
  • Asad Ali Jamali University of Essex Colchester
  • Mazher Ali Institute of Mathematics and Computer Science, Jamshoro, Sindh
  • Abdul Khalique Baloch

DOI:

https://doi.org/10.21015/vtse.v11i3.1580

Abstract

Blockchain technology is a transparent, and unchangeable distributed ledger. It has the potential to transform the way to interact with the digital world by allowing to construct a decentralized database that is tamper-proof. Concerns regarding the security of confidential and sensitive data being outsourced are rising. It is possible that service providers may be dishonest since unscrupulous administrators have access to, may alter, and can misuse private and sensitive data. Security precautions are necessary because sensitive data stored on public clouds has to be safeguarded. There is no mechanism to detect data changes, as data are stored in plaintext. Therefore, maintaining privacy and secrecy is impossible. It is important that data must always be kept secure, even after it has been kept on the server. Data stored on the server must be safeguarded against outsider access and, if the insider cannot be trusted, must also be safeguarded against hostile insiders. Asymmetric algorithms are employed to safeguard data during transmission. Asymmetric cryptography is required in modern security systems, and several algorithms have been devised to provide safe and effective encryption and decryption. Asymmetric algorithms are empirically compared in this study. We evaluated each algorithm's performance by taking into account criteria such as key size, memory utilization, and execution time. Our results show that while all algorithms provide safe encryption and decryption, there are significant performance disparities between them. It is determined, in particular, that ECC required the least amount of memory and had the shortest key size. The findings show that ECC's prime and binary fields created pairs of keys faster and with more security than other asymmetric algorithms with smaller bit sizes. On small, medium, and big datasets, ECC had the fastest execution time for plaintext encryption operations. These findings have important implications for the selection and deployment of asymmetric algorithms in various security systems.

References

Mary Agoyi and Devrim Seral, (2010). “Sms Security: An Asymmetric Encryption Approach”, IEEE Sixth International Conference on Wireless and Mobile Communications, 978-0-7695-4182-2, DOI 10.1109/ICWMC.2010.87.

Keerthi K and Dr. B. Surendiran, (2017). “Elliptic Curve Cryptography for Secured Text Encryption”, IEEE International Conference on circuits Power and Computing Technologies [ICCPCT].

Sarika Y. Bonde and Prof. Dr. U.S. Bhadade, (2017). “Analysis of Encryption Algorithms (RSA, SRNN and 2 key pair) for Information Security”, IEEE 978-1-5386-4008-1/17, pp-1-4.

Young Sil Lee, Esko Alasaarela and Hoon Jae Lee, (2014). “An Efficient Encryption Scheme using Elliptic Curve Cryptography (ECC) with Symmetric Algorithm for Healthcare System”, International Journal of Security and Its Applications Vol.8, No.3 (2014), pp.63-70 http://dx.doi.org/10.14257/ijsia. 2014.8.3.07.

Z. Parker, S. Poe, S. V. Vrbsky, “Comparing NoSQL MongoDB to an SQL DB”, In Proceedings of the 51st ACM Southeast Conference (ACMSE '13). ACM, New York, NY, USA, Article 5, 6 pages, April 4-6, 2013.

Dr. D.I. George Amalarethinam and H.M. Leena, (2017). “ Enhanced RSA Algorithms with varying Key Sizes for Data Security in Cloud”, IEEE World Congress on Computing and Communication Technologies (WCCCT), 978-5090-5573-9/17, pp-172-175.

Srinivasan Nagaraj, Dr.G.S.V.P.Raju, V.Srinadth, (2015). “Data Encryption and Authentication Using Public Key Approach”, Elsevier Procedia Computer Science 48, pp. 126 – 132.

Ashutosh Kumar Dubey, Animesh Kumar Dubey, Mayank Namdev, Shiv Shakti Shrivastava, (2016). “Cloud-User Security Based on RSA and MD5 Algorithm for Resource Attestation and Sharing in Java Environment”, IEEE, doi:10.1109/CONSEG.2012.6349503, pp. 1-8.

Rama Roshan Ravan, Norbik Bashah Idris and Zahra Mehrabani, (2013). “A Survey on Querying Encrypted Data for Database as a Service”, IEEE International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, pp-14-18. DOI 10.1109/CyberC.2013.12.

M. R. Jamali, A. G. Memon, M. R. Maree, (2020). “Security issues in data at rest in a non-relational Document Database”, Sindh Univ. Res. Jour. (Sci. Ser.) Vol. 52 (03) 279-284 (2020), pp-279-283. http://doi.org/10.26692/sujo/ 2020.09.41.

Mujeeb-ur-Rehman Jamali, Abdul Ghafoor Memon, Nadeem A. Kanasro, Mujeeb-u-Rehman Maree, (2021). “Data integrity issues and challenges in next generation non-relational document-oriented database outsourced in public cloud”, International Journal of Emerging Trends in Engineering Research, Volume 9. No. 4, pp 416-420. https://doi.org/10.30534/ijeter/2021/ 13942021.

Shaikh A, Solanki K and Uttekar V and Vishwakarma N, (2014). “Audio steganography and security using cryptography”. Int J Emerg Technol Adv Eng 4(2):317–318.

Saurabh J and Ambhaikar A, (2012). “Audio steganography using RPrime RSA and GA based LSB algorithm to enhance security”. Int J Sci Res 1(2):62–65.

Downloads

Published

2023-09-30

How to Cite

Jamali, M.- ur-R., Channa, D. N. N., Jamali, A., Jamali, A. A., Ali, M., & Baloch, A. K. (2023). Blockchain Technology Performance of Asymmetric Algorithms: An Empirical Study. VFAST Transactions on Software Engineering, 11(3), 10–24. https://doi.org/10.21015/vtse.v11i3.1580