Concurrent factorization of RSA moduli via weak key equations

Concurrent factorization of RSA moduli via weak key equations

The Rivest-Shamir-Adleman (RSA) algorithm is a widely utilized technique in asymmetric cryptography, primarily for verifying digital signatures and encrypting messages. Its security relies on the integer factorization problem's difficulty, which is computationally infeasible with large security...

Full description

Bibliographic Details
Main Authors: Wan Nur Aqlili Ruzai, You Ying, Khairun Nisak Muhammad, Muhammad Asyraf Asbullah, Muhammad Rezal Kamel Ariffin
Format: Article
Language:English
Published: AIMS Press 2024-09-01
Series:AIMS Mathematics
Subjects:
asymmetric cryptography
rsa
diophantine approximations
lattice cryptanalysis
continued fractions
Online Access:https://www.aimspress.com/article/doi/10.3934/math.20241368?viewType=HTML

Internet

https://www.aimspress.com/article/doi/10.3934/math.20241368?viewType=HTML

Similar Items