New simultaneous Diophantine attacks on generalized RSA key equations
RSA stands as a widely adopted method within asymmetric cryptography, commonly applied for digital signature validation and message encryption. The security of RSA relies on the challenge of integer factorization, a problem considered either computationally infeasible or highly intricate, especially...
Main Authors: | Ruzai, Wan Nur Aqlili, Ariffin, Muhammad Rezal Kamel, Asbullah, Muhammad Asyraf, Abd Ghafar, Amir Hamzah |
---|---|
Format: | Article |
Language: | English |
Published: |
King Saud bin Abdulaziz University
2024
|
Online Access: | http://psasir.upm.edu.my/id/eprint/113455/1/113455.pdf |
Similar Items
-
New simultaneous Diophantine attacks on generalized RSA key equations
by: Wan Nur Aqlili Ruzai, et al.
Published: (2024-06-01) -
A new simultaneous diophantine attack upon RSA moduli N = pq
by: Abubakar, Saidu Isah, et al.
Published: (2018) -
Increment of insecure RSA private exponent bound through perfect square RSA diophantine parameters cryptanalysis
by: Wan Mohd Ruzai, Wan Nur Aqlili, et al.
Published: (2022) -
Concurrent factorization of RSA moduli via weak key equations
by: Ruzai, Wan Nur Aqlili, et al.
Published: (2024) -
Concurrent factorization of RSA moduli via weak key equations
by: Wan Nur Aqlili Ruzai, et al.
Published: (2024-09-01)