Timeline for Is it possible to recover an RSA modulus from its signatures?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 6, 2015 at 2:09 | history | edited | Myria |
not really "key-recovery"
|
|
| Nov 5, 2015 at 21:09 | vote | accept | Myria | ||
| Nov 5, 2015 at 6:59 | answer | added | Robert Quattlebaum | timeline score: 4 | |
| Nov 4, 2015 at 12:04 | answer | added | user27950 | timeline score: 14 | |
| Nov 4, 2015 at 9:21 | history | edited | Maarten Bodewes♦ | CC BY-SA 3.0 |
added 1 character in body
|
| Nov 4, 2015 at 9:21 | comment | added | fgrieu♦ |
Note: I tend to write ${c_k}^e\equiv m_k\pmod n$ using \pmod rather than \mod (thanks to Maarten Bodewes for making just that). Hint: by definition that means $n$ is a divisor of ${c_k}^e-m_k$, and you know or can guess everything in several of these expressions. Note: recovering $n$, which is normally assumed public, hardly qualifies as a key recovery attack.
|
|
| Nov 4, 2015 at 3:25 | history | asked | Myria | CC BY-SA 3.0 |