Abstract

RSA is a robust and widely utilized public-key scheme to ensure the confidentiality and authenticity of digital communication and data transmission over the Internet, including online banking, e-commerce, e-mail, and blockchain-based apps. The RSA decryption and signature generation algorithms are computationally expensive, particularly for resource-constrained devices. RSA algorithms have been the subject of numerous research studies to improve their speed over the past few decades. This research has focused on developing various optimizations and alternative algorithms to reduce the computational complexity of RSA processes while ensuring an acceptable security level. This paper surveys four RSA variants created to speed up RSA decryption and signing generation. Using the window exponentiation method, the implementation outcomes show that the RSA scheme gets fast decryption and signing generation processes when using a secure multi-prime modulus and CRT to decrypt and sign.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call