On the Improvement Attack Upon Some Variants of RSA Cryptosystem via the Continued Fractions Method

On the Improvement Attack Upon Some Variants of RSA Cryptosystem via the Continued Fractions Method

Let N = pq be an RSA modulus where p and q are primes not necessarily of the same bit size. Previous cryptanalysis results on the difficulty of factoring the public modulus N = pq deployed on variants of RSA cryptosystem are revisited. Each of these variants share a common key relation utilizing the...

Full description

Bibliographic Details
Main Authors: Wan Nur Aqlili Ruzai, Muhammad Rezal Kamel Ariffin, Muhammad Asyraf Asbullah, Zahari Mahad, Athirah Nawawi
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Algebraic cryptanalysis
continued fractions method
integer factorization problem
RSA-variants
Online Access:https://ieeexplore.ieee.org/document/9079788/

Internet

https://ieeexplore.ieee.org/document/9079788/

Similar Items