Timeline for Proving that RSA encryption function with non-square free modulus is not a permutation
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 19, 2020 at 14:48 | vote | accept | Henadzi Matuts | ||
| Aug 18, 2020 at 21:50 | comment | added | poncho | @HenadziMatuts: well, if $e>1, \phi(q)$ are relatively prime, and $p, q$ are relatively prime, then any value $kp^2$ will have multiple preimages for the function $f(x) = x^e \bmod p^2q$; the various examples you found are of this form. | |
| Aug 18, 2020 at 18:42 | comment | added | Henadzi Matuts | Thanks for the explanation! I'm also wondering why there are ciphertexts other then 0 which also have multiple preimages, and how the occurence of such ciphertexts could be generalized. | |
| Aug 18, 2020 at 18:40 | history | edited | poncho | CC BY-SA 4.0 |
added 28 characters in body
|
| Aug 18, 2020 at 18:32 | history | answered | poncho | CC BY-SA 4.0 |