Timeline for Why in RSA do we use mod n rather than mod phi(p⋅q)?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 28, 2020 at 13:02 | vote | accept | KMG | ||
| Nov 28, 2020 at 12:14 | history | edited | fgrieu♦ | CC BY-SA 4.0 | Polish |
| Nov 28, 2020 at 11:40 | comment | added | fgrieu♦ | This is closely related to Why do we need Euler's totient function $φ(N)$ in RSA?. The bottom line is that it's wrong to assume $X^f\equiv X^{f\bmod m}\pmod m$, and in the question that's done when going from $e\cdot d \ \equiv \ 1\pmod{\phi(p\cdot q)}$ to the incorrect ${(X^e)}^d \equiv X \pmod{\phi(p\cdot q)}$. | |
| Nov 28, 2020 at 11:28 | history | edited | fgrieu♦ | CC BY-SA 4.0 | Fix some of the notation |
| S Nov 28, 2020 at 11:20 | history | suggested | Modal Nest | CC BY-SA 4.0 | clarity, as per comments. without understanding the maths it was difficult to understand the question. |
| Nov 28, 2020 at 10:11 | comment | added | Modal Nest | I've submitted an edit to your question which makes it clear I think (i left the maths alone!). The first answer suggests it wasn't clear to people who understood the maths too. | |
| Nov 28, 2020 at 10:03 | answer | added | ambiso | timeline score: 3 | |
| Nov 28, 2020 at 10:00 | review | Suggested edits | |||
| S Nov 28, 2020 at 11:20 | |||||
| Nov 28, 2020 at 9:34 | comment | added | KMG | @ModalNest yes this is exactly what i mean which is it should decrypt correctly . | |
| Nov 28, 2020 at 9:06 | comment | added | Modal Nest | I don't think your question is clear. Although it might just be my lack of mathematical ability. If you are simultaneously encrypting and decrypting, what is the purpose? Why would you do it? Do you mean it should work, but it doesn't, and you are asking mathematically why it doesn't? | |
| Nov 28, 2020 at 8:50 | comment | added | KMG | @ModalNest I'm not putting them together I'm just demonstrating the process of encrypting then decryption at the same time. | |
| Nov 28, 2020 at 8:48 | comment | added | Modal Nest | e is the public key and d is the private key. What is gained by putting them together? Assuming it works, isn't it just turning RSA into a resource-hungry symmetric cipher? | |
| Nov 28, 2020 at 8:31 | history | asked | KMG | CC BY-SA 4.0 |