Lightweight Rsa Algorithm Using Three Prime Numbers

Mustafa M Abd Zaid,Dr Soukaena Hassan

doi:10.14419/ijet.v7i4.36.23790

Mustafa M Abd Zaid, Dr Soukaena Hassan

Open Access

https://doi.org/10.14419/ijet.v7i4.36.23790

Copy DOI

Abstract

The computing devices utilized as a part of an extensive class of remote correspondence systems, for example, cell phones, remote sensor systems (WSNs), vehicular ad hoc networks (VANETs), mobile ad hoc networks (MANETs), Internet of Things (IoT), body area networks (BANs) and so on, are little and asset compelled. In the current developments of the resource constraint environments, the trend is shifted towards lightweight cryptographic algorithm. Many lightweight cryptographic algorithms have been developed and also existed algorithms are modified in terms of resource constraint environments. One of such new procedures is utilizing three prime numbers for RSA cryptosystem, which is not easily breakable. Our approach using three prime number rather than two prime-dependent systems to get (n) with same length of standard RSA but less bits for prime numbers. The suggested algorithm has speed enhancement on standard RSA key generation side and decryption side by utilizing three primes and the Chinese Reminder Theorem (CRT). The results indicate that the average of speed improvement is ~80% in key generation process, ~96% in decryption process, and only 4% in the encryption process.

Highlights

The encryption system using asymmetric key includes the utilization of two unmistakable related keys, the private key and the public key (1)
The expectation that the encryption work is the security of RSA that depends on, it is computationally infeasible for an intruder to decode a cipher text
The results show that the modified RSA algorithm was faster than the standard RSA especially when taking in considerations key generation and decryption steps

Summary

1.Introduction

The encryption system using asymmetric key includes the utilization of two unmistakable related keys, the private key and the public key (1). The original message is changed over to cipher text utilizing the public key. This one procedure is called “encryption” which is completed by the sender. Since information of the public key isn't adequate to decrypt the cipher-text, messages exchange can be done in a protected way. The standard RSA-algorithmbased end of “n” and insertion of a new number f in the place of n is the security highlight proposed This replacement is used in both private and public keys. Ex and N (ex, N) are the Public Key, d and N (d, N) are the Private Key. To recover the message from cipher-text Cm, we use the concept of RSA with CRT on the decryption process. Figure[1] given below shows the flowchart of the proposed RSA algorithm, which is suggested here in this paper

Encryption of RSA

Proposed RSA

The proposed RSA-based key generation

Experiment results

3.Conclusion