Timeline for Why does my attempt at RSA break?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 2, 2018 at 7:29 | comment | added | kodlu | eulerphi 800 2990 wrongphi 2990 1 plaintext 101 ciphertext 2051 wrong decryption key 2563 decryption 231 correct d 343 correct ciphertext 301 decryption 101 | |
| Mar 2, 2018 at 7:29 | comment | added | kodlu | n:=11*300; "eulerphi", EulerPhi(n); phi:=10*299;phi;"wrongphi", phi; e:=7; GCD(e,phi); m:=101; "plaintext", m; c:= m^7 mod phi; "ciphertext under wrong phi", c; d:=Modinv(7,phi); "wrong decryption key", d; "decryption", c^d mod phi; d:=Modinv(7,EulerPhi(n)); "correct d",d; c:=m^7 mod EulerPhi(n); "correct ciphertext", c; "decryption", c^d mod EulerPhi(n); this magma code gives | |
| Mar 2, 2018 at 7:26 | comment | added | kodlu | No, it has failed for me on the first experiment. | |
| Mar 2, 2018 at 6:57 | comment | added | Phoenixdeath | Does 2 being a factor have a special case for it, though? It seems like when I choose any other prime and composite (say $p = 11$ and $q=300$) it does not break it; only when it is 2 and a composite. | |
| Mar 2, 2018 at 6:36 | history | answered | kodlu | CC BY-SA 3.0 |