AN OVERVIEW OF FAST VARIANTS OF THE RSA CRYPTOSYSTEM FOR MODERN CRYPTOGRAPHY APPLICATIONS

Обзор быстрых вариантов криптосистемы RSA для современных криптографических приложений
Yassine Maleh, Khalid El Makkaoui, Abderrahim Beni‐Hssane, Ibrahim Ouahbi, Youssef Lamriji
2023-05-26

Chinese Remainder TheoremRSA cryptosystemRSA decryptionRSA signature generationmulti-prime modulus
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.
1
Implementation results using window exponentiation show faster RSA decryption and signature generation with secure multi-prime moduli and the Chinese Remainder Theorem.
2
RSA decryption and signature generation are computationally expensive, especially on resource-constrained devices.
3
The paper surveys four RSA variants designed to accelerate decryption and signing while maintaining an acceptable security level.
4
The surveyed optimizations target reduced computational complexity for modern applications including online banking, e-commerce, email, and blockchain systems.

RSA cryptosystem and its fast variants for modern cryptography applications

Optimization of RSA decryption and signature generation speed using secure multi-prime moduli, the Chinese Remainder Theorem (CRT), and window exponentiation while maintaining an acceptable security level

Publication Details
Publication Date
2023-05-26
Journal
Publisher
ISSN
Cited by
2
Access Type
Author Information
Authors
Yassine Maleh
Khalid El Makkaoui
Abderrahim Beni‐Hssane
Ibrahim Ouahbi
Youssef Lamriji
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat →
Make a presentation
100%