Timeline for RSA cracking: The same message is sent to two different people problem
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 9, 2020 at 20:19 | comment | added | fgrieu♦ | It is silently assumed that the quantities manipulated are well defined, and while that holds in the example, and in many cryptanalytic cases, that's a loophole from a mathematical standpoint: $c_2^{-1} \bmod n$ might be undefined. See the last numerical example in this answer. | |
| Feb 16, 2018 at 13:21 | history | edited | mikeazo | CC BY-SA 3.0 |
added 220 characters in body
|
| Jan 10, 2012 at 13:54 | vote | accept | Tomas | ||
| Jan 10, 2012 at 13:25 | vote | accept | Tomas | ||
| Jan 10, 2012 at 13:25 | |||||
| Jan 10, 2012 at 13:12 | history | edited | mikeazo | CC BY-SA 3.0 |
Added a practical note.
|
| Jan 10, 2012 at 12:45 | history | rollback | mikeazo |
Rollback to Revision 1
|
|
| Jan 10, 2012 at 12:44 | history | edited | mikeazo | CC BY-SA 3.0 |
fixed an equation that was wrong
|
| Jan 10, 2012 at 12:36 | history | answered | mikeazo | CC BY-SA 3.0 |