Timeline for Computational complexity of RSA
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 17, 2018 at 22:53 | comment | added | Maarten Bodewes♦ | I don't see the thing you're hinting at; the private key ops (sign) clearly differ more than the public key ops (verify). | |
| Apr 17, 2018 at 22:50 | history | edited | Squeamish Ossifrage | CC BY-SA 3.0 |
encrypt one letter with rot12
|
| Apr 17, 2018 at 11:03 | answer | added | dave_thompson_085 | timeline score: 5 | |
| Apr 17, 2018 at 5:38 | comment | added | fgrieu♦ | Hint: when multiplying two $n$-digit numbers by hand, how many times do you use an elementary single-digit multiplication? About how many for manually reducing the result modulo another $n$-digit number (slightly larger than the two ones multiplied)? How many such modular multiplications are needed for the textbook RSA operation $x\to x^e\bmod N$ with $e=2^k+1$ and small $k$? For $x\to x^d\bmod N$ with $d$ a corresponding private exponent? | |
| Apr 16, 2018 at 22:51 | answer | added | Squeamish Ossifrage | timeline score: 3 | |
| Apr 16, 2018 at 19:39 | history | asked | Smit Johnth | CC BY-SA 3.0 |