On the distribution of the number of ones in the output sequence of the MCV-generator over $GF(2)$
Matematičeskie voprosy kriptografii, Tome 4 (2013) no. 4, pp. 95-107
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
For the distribution of the number of ones in the whole cycle of the output sequence of the MCV-generator over the field $GF(2)$ we obtain estimates of the accuracy of normal-like approximations.
[1] Pohl P., “Description of MCV, a pseudo-random number generator”, Scand. Actuarial J., 1976:1 (1976), 1–14 | DOI | MR | Zbl
[2] Petrov V. V., Summy nezavisimykh sluchainykh velichin, Nauka, M., 1972 | MR
[3] Tyurin I. S., “Utochneniya ostatochnogo chlena v teoreme Lyapunova”, Teoriya veroyatn. i primenen., 56:4 (2011), 808–811 | DOI