Timeline for Does using modulo (%) affect quality of randomness?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2019 at 8:09 | history | edited | kelalaka | CC BY-SA 4.0 |
latex and typos
|
| Feb 6, 2015 at 13:41 | comment | added | tylo | "Randomly" is too unspecific without further specification. If you say $x \leftarrow \mathbb{Z}_p, y = x$ mod $q$, then $x$ is almost uniform distributed if $q$ is much smaller than $p$. And it is only (really) uniform distributed, if the cardinalities match (e.g. going from $\mathbb{Z}_6$ to $\mathbb{Z}_3$, where "mod 3" has two preimages each). | |
| Feb 6, 2015 at 9:22 | comment | added | 111 | You can assume that $\pmod q$ behave randomly. I saw this assumption in some papers. | |
| Feb 5, 2015 at 19:02 | history | edited | Seth | CC BY-SA 3.0 |
added 71 characters in body
|
| Feb 5, 2015 at 18:55 | history | edited | Seth | CC BY-SA 3.0 |
Fixed error identified by tylo
|
| Feb 5, 2015 at 15:05 | vote | accept | CommunityBot | ||
| Feb 5, 2015 at 10:05 | comment | added | tylo | Minor correction at 1): In the last sentence is should be "output a 0 twice as often as a 3" (probability 1/6 and 2/6) | |
| Feb 4, 2015 at 20:56 | history | answered | Seth | CC BY-SA 3.0 |