AASCIT - Journal - All Issues

International Journal of Information Engineering and Applications

The Journal

Indexing

Manuscript Information

Application of SHA-256 in Formulation of Digital Signatures of RSA and Elgamal Cryptosystems

International Journal of Information Engineering and Applications
Vol.1 , No. 2, Publication Date: Mar. 23, 2018, Page: 61-66

771 Views Since March 23, 2018, 656 Downloads Since Mar. 23, 2018

Paper in PDF (2102K)

Follow on

Authors

[1]	Aderemi Elisha Okeyinka, Department of Computer Science, Landmark University, Omu-Aran, Nigeria.
[2]	Oluwatobi Alao, Department of Computer Science, Landmark University, Omu-Aran, Nigeria.
[3]	Babatunde Gbadamosi, Department of Computer Science, Landmark University, Omu-Aran, Nigeria.
[4]	Roseline Oluwaseun Ogundokun, Department of Computer Science, Landmark University, Omu-Aran, Nigeria.

Abstract

In this study, the two cryptosystems are considered for computational speed efficiency using SHA-256 in formulation of digital signature. The goal of this study is to observe whether or not the application of SHA-256 hash function would yield any significant difference in the literature position that RSA is a more efficient cryptosystem than Elgamal. The methodology employed involves Java programming implementation of the RSA and Elgamal cryptosystems using SHA-256 hash function. Ten different text data of various sizes are used as input data, and the internal clock of the computer is used in monitoring and calculating the computational speeds of both the RSA and Elgamal. The results obtained show that there is no significant difference in the computational speeds of both strategies. This is unlike the earlier results found in the literature which shows that RSA is more efficient. A plausible explanation for this is that the SHA-256 hash function has a significant effect on the implementation. However, since SHA-256 is just one of the versions of SHA-2 hash family, a study that will consider other members of the SHA-2 family is recommended to enable us formulate a theorem or conjecture on the effect of hash function on cryptosystems, and in particular the RSA and Elgamal cryptosystems.

Keywords

Cryptosystems, Digital Signature, Elgamal, RSA, SHA-256

Reference

[01]	Alfred J. Menezes, Vanstone, S. A., & van Oorschot, P. C. (1997). Handbook of applied cryptography. CRC press.
[02]	Elgamal T. (1985), A public key cryptosystems and signature scheme based on discrete logarithms. IEEE trans Inf Theory 31 (4): 469-472.
[03]	Fips, P. U. B. (2000). 186-2. Digital signature standard (DSS). National Institute of Standards and Technology (NIST).
[04]	Hans Deifs and Helmut Knebl (2006), Introduction to cryptography, principles and applications: second Edition, Springer publisher.
[05]	International Association of Engineers [online]. Available: http://www.iaeng.org (Elbirt AJ (2008). Understnding and applying cryptography and data security. Auebach publications, Taylor and Francis Group).
[06]	Kessler, G. C. (2016). An Overview of Cryptography (Updated Version, 3 March 2016).
[07]	Okeyinka A. E. (2015), computational speeds analysis of RSA and Elgamal algorithms on text data. In proceedings of the world congress on engineering and computer science 2015, WCECS 2015, Lecture Notes in Engineering and Computer Science, 21-23 October 2015, San Fransisco, USA, pp 115-118.
[08]	Okeyinka A. E. (2017), Computational Complexity Study of RSA and Elgamal Algorithms; Transactions on Engineering Technologies; Springer Nature Singaporw Pte Ltd. DOI 10.1007/978-981-10-2717-8_17.
[09]	Rednam Venkata Ramana, B. Lakshmana Rao, (2013),” Design and Implementation of Digital Signatures”, International Journal of Latest Trends in Engineering and Technology (IJLTET).
[10]	Sobti, R., & Geetha, G. (2012). Cryptographic hash functions: a review. IJCSI International Journal of Computer Science Issues, 9 (2), 461-479.