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 para...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Institute of Mathematical Sciences
2024
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/114924/1/114924.pdf http://psasir.upm.edu.my/id/eprint/114924/ http://www.aimspress.com/article/doi/10.3934/math.20241368 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!