Timeline for RSA: How to compute the number of possible plaintexts if $e$ is not coprime to $\varphi(n)$?
Current License: CC BY-SA 4.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 30, 2020 at 5:35 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Fix
|
| Aug 30, 2020 at 4:39 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 29, 2020 at 18:31 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 29, 2020 at 17:13 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Fix. Simplify selection of 🄐 and 🄑 for search perposes; polish alignment.
|
| Aug 29, 2020 at 16:18 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 29, 2020 at 16:07 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Trim and polish
|
| Aug 29, 2020 at 15:52 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Typography
|
| Aug 29, 2020 at 15:47 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Typography
|
| Aug 29, 2020 at 15:40 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Number solutions, and simplify
|
| Aug 28, 2020 at 6:03 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Note similarity with Pohlig-Hellman cipher
|
| Aug 27, 2020 at 20:40 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 27, 2020 at 20:34 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 27, 2020 at 20:21 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 27, 2020 at 20:08 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 27, 2020 at 19:45 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 27, 2020 at 19:18 | comment | added | fgrieu♦ | @poncho: Yes. I've added that, and the conditions. | |
| Aug 27, 2020 at 19:18 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 27, 2020 at 18:49 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Aug 27, 2020 at 18:41 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Improve
|
| Aug 27, 2020 at 18:16 | comment | added | poncho | I believe that the answer you're trying to get to is, assuming $c$ is relatively prime to $pq$, then $c^e = m \bmod pq$ has either $\gcd( p-1, e ) \gcd( q-1, e )$ solutions or none. Complications that you've considered: what if $e$ is composite? What if both $p-1, q-1$ is not r.p. to $e$? | |
| Aug 27, 2020 at 18:12 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
deleted 1 character in body
|
| Aug 27, 2020 at 18:06 | history | answered | fgrieu♦ | CC BY-SA 4.0 |