Mathematical Attack of RSA by Extending the Sum of Squares of Primes to Factorize a Semi-Prime
The security of RSA relies on the computationally challenging factorization of RSA modulus with being a large semi-prime consisting of two primes for the generation of RSA keys in commonly adopted cryptosystems. The property of both congruent to 1 mod 4, is used in Euler’s factorization method to th...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-09-01
|
| Series: | Mathematical and Computational Applications |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2297-8747/25/4/63 |