Timeline for How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 18, 2020 at 14:41 | answer | added | poncho | timeline score: 3 | |
| Jul 17, 2020 at 23:31 | comment | added | kodlu | Also such a small $p$ is a massive security risk, even for properly designed RSA. | |
| Jul 17, 2020 at 20:26 | comment | added | fgrieu♦ | Welcome to crypto-SE. If $\gcd(e,\varphi(n))\ne1$, then $e^{-1}\bmod\varphi(n)$ is undefined. Thus some of the calculated stuff is wrong. Hint: use the given that $p$ has size 20 (I guess that's bits) to factor $n$. | |
| Jul 17, 2020 at 19:22 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Jul 17, 2020 at 14:51 | history | edited | user81147 | CC BY-SA 4.0 |
added 26 characters in body
|
| Jul 17, 2020 at 14:50 | comment | added | user81147 | so we calculate phi(n) from (p-1)*(q-1). e is 65537, when i calculated GCD(e,phi(n)) it returns 65537 | |
| Jul 17, 2020 at 14:21 | comment | added | Ievgeni | From that, we got : "GCD(e,phi(n)) = 65537" Could you give more details??? | |
| Jul 17, 2020 at 12:46 | history | edited | user81147 | CC BY-SA 4.0 |
added 6 characters in body
|
| Jul 17, 2020 at 12:39 | history | asked | user81147 | CC BY-SA 4.0 |