Implementation of the RSA algorithm and its cryptanalysis
Chandra M. Kota, Cherif Aissi · 2022
In this paper the implementation of the Rivest-Shamir-Adleman (RSA) encryption algorithm is presented.The secret key consists of two large prime numbers p and q, and a part of the public key is their product, n = pq.The RSA cryptosystem security is investigated.It is shown that if the secret exponent length is approximately one quarter as many bits as the modulus(n), there is a way to attack the RSA algorithm.The cryptanalysis of the RSA algorithm is also discussed.