Timeline for Msieve & Yafu - RSA Exponents and bruteforcing
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 13, 2019 at 21:20 | vote | accept | Acinomatnas | ||
| Dec 13, 2019 at 7:18 | comment | added | fgrieu♦ | @MercuryValentine: yes, see revised second paragraph. I suggest that you try what I outline in the last paragraph before spending too much CPU cycles on GNFS. Also: if the key generator's code is available (e.g.it was in the client-side of the "long-shutdown videogame", reverse-engineering that may uncover an exploitable weakness. | |
| Dec 13, 2019 at 6:59 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Expand
|
| Dec 12, 2019 at 23:59 | comment | added | Acinomatnas | I've compiled and ran it as well as looked through its options, and this certainly seems to be the best program I've seen. Looking at examples, it outputs two factors when it finishes. Just to confirm as I haven't tested myself, this pair and the exponent 17 will be sufficient to calculate the private key? | |
| Dec 12, 2019 at 8:31 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
edited body
|
| Dec 12, 2019 at 8:11 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
added 214 characters in body; deleted 2 characters in body; added 4 characters in body
|
| Dec 12, 2019 at 7:58 | history | answered | fgrieu♦ | CC BY-SA 4.0 |