Encryption and Decryption Analysis of the RSA Digital Signature Based on MD5 and SHA Hash Functions Using Strong Prime

Abdelmajid Hassan Mansour

Abstract


RSA digital signature is the most common public key crypto system that used widely on data security. The encryption and decryption time computation of the signature generation and verification is still a big problem an important issue that challenging the RSA security. This paper analyses the encryption and decryption time of the RSA Digital Signature based on the hash functions MD5, SHA-160, SHA-256, and SHA-512. The private key and public key of the RSA generated by using the “Strong prime”, then compare it with the original RSA method. The main goal of the proposed scheme is to optimize and speed up the process of encrypting and decrypting time on a variable length of message, and different hash functions. This will overcome the problem of processing time and computational overheads of the RSA digital signature system. 


Keywords


RSA digital signature, Private key, Public key, Encryption, Decryption, Strong prime, Hash function, Message digest.

Full Text:

Abstract PDF

References


Bhala, A. S., Kshirsagar, V. P., Nagori, M. B., & Deshmukh, M. K. (2011). Performance Comparison of Elliptical Curve and RSA Digital Signature on ARM7. In Proceedings of International Conference on Information and Network Technology (IPCSIT), Singapore. (4), (2011), pp. 58-62.

Gola, K. K., Gupta, G., & Iqbal, Z. (2014). Modified RSA Digital Signature Scheme for Data Confidentiality. International Journal of Computer Applications, 106 (13), (November 2014), pp. 13-16.

Ali, A. I. (2015). COMPARISON AND EVALUATION OF DIGITAL SIGNATURE SCHEMES EMPLOYED IN NDN NETWORK. International Journal of Embedded systems and Applications (IJESA). 5(2), (June 2015), p. 15-29.

Jaafar, A. M. & Samsudin, A. (2010). Visual Digital Signature Scheme: A New Approach. IAENG International Journal of Computer Science, 37(4).

Pon, S. E., Lu, E. H., & Jeng, A. B. (2005). Meta-He digital signatures based on factoring and discrete logarithms. Applied Mathematics and Computation 165, www.elsevier.com/locate/amc, pp. 171–176.

Vijay, A., Trikha, P., & Madhur K. (2012). A New Variant of RSA Digital Signature. International Journal of Advanced Research in Computer Science and Software Engineering, 2(10), (October 2012), pp. 366-371.

Menezes, A. J., Oorschot, P. C. V., & Vanstone, S. A. (1996). HANDBOOK of APPLIED CRYPTOGRAPHY.

Crandall, R. (2000). Prime Numbers a Computational Perspective, Carl Pomerance, Second Edition, ISBN-10: 0-387-25282-7, springeronline.

Meng, X., &Zheng, X. (2015). Cryptanalysis of RSA with a small parameter revisited. Information Processing Letters 115, Elsevier, June 2015, p. 858–862.

Sarkar, S., &Maitra, S. (2010). Cryptanalysis of RSA with two decryption exponents. Information Processing Letters 110, Elsevier, (December 2010), pp. 178–181.

Sarkar, S., &Maitra, S. (2010). Cryptanalysis of RSA with more than one decryption exponent. Information Processing Letters 110, Elsevier, (March 2010), pp. 336–340.

Thangavel, M., Varalakshmi, M., Murrali, M., & Nithya, K. (2015). An Enhanced and Secured RSA Key Generation Scheme (ESRKGS). Journal of information security and applications 20, www.elsevier.com/locate/jisa, pp. 3-10.

Pallipamu, V. R., Reddy K., T., & Varma P. S. (2014). Design of RSA Digital Signature Scheme Using ANovel Cryptographic Hash Algorithm. International Journal of Emerging Technology and Advanced Engineering, 4(6), (June 2014), pp. 609-612.

Zhu, H., & Li, D. (2008). Research on Digital Signature in Electronic Commerce. In Proceedings of the International Multi Conference of Engineers and Computer Scientists (IMECS), 19-21 March, (I), Hong Kong. Retrieved from http://www.iaeng.org/publication/IMECS2008.

Mahto, D.,Khan, D. A., & Yadav, D. K. (2016). Security Analysis of Elliptic Curve Cryptography and RSA. In Proceedings of the World Congress on Engineering (WCE), June 29 - July 1, (I), London, U.K. Retrieved from http://www.iaeng.org/publication/WCE2016.

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 (WCECS), October 21-23, (1), San Francisco, USA. Retrieved from http://www.iaeng.org/publication/WCECS2015.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.