RSA: A number of formulas to improve the search for p+qp+q
Breaking RSA is one of the fundamental problems in cryptography. Due to its reliance on the difficulty of the integer factorization problem, no efficient solution has been found despite decades of extensive research. One of the possible ways to break RSA is by finding the value p+q{p+q}, which requi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2017-12-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2016-0046 |