Timeline for Randomizing Prime Field Elements
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 14, 2018 at 14:31 | vote | accept | Arya Pourtabatabaie | ||
| Sep 13, 2018 at 21:33 | comment | added | Arya Pourtabatabaie | One could say for $n=r \mod p$, $x\in_RZ_n$ and $t=x \mod p$ we have: $P\{t=t_0|t_0<r\}=\frac{n-r}n\times \frac 1 p + \frac 1 n$ and $P\{t=t_0|t_0\geq r\}=\frac{n-r}n\times \frac 1 p$. These probabilities converge to each other and to $\frac 1 p$ as $n$ grows, giving us statistical indistinguishability. | |
| Sep 13, 2018 at 21:03 | comment | added | poncho | @AryaPourtabatabaie: I'm not sure if anyone bothered publishing anything, but it's fairly straightforward to show that someone looking at the outputs cannot distinguish it from a random unbiased output stream with much less than $2^{128}$ outputs | |
| Sep 13, 2018 at 20:58 | comment | added | Arya Pourtabatabaie | Thanks. Is there a formal analysis of this method? | |
| Sep 13, 2018 at 20:40 | history | answered | poncho | CC BY-SA 4.0 |