On the number of ones in outcome sequence of extended Pohl generator
-
Natalia M. Mezhennaya
und
Vladimir G. Mikhailov
Abstract
Formulas for distributions of number of ones (non-zeroes) in the cycle of the output sequence of generalized binary Pohl generator are obtained. Limit theorems for these distributions are derived in the case when the lengths of registers are coprime and tend to infinity, the contents of different registers are independent, but cell contents within each register may be dependent. The consequences of these theorems are given for the case when the contents of cells are independent random variables having equiprobable distribution on {0, 1}.
Originally published in Diskretnaya Matematika (2019) 31, №1, 111–124 (in Russian).
Acknowledgment
Authors are grateful to A.M. Zubkov for valuable notes.
References
[1] Pohl P., “Description of MCV, a pseudo-random number generator”, Scand. Actuar. J., 1 (1976), 1–14.10.1080/03461238.1976.10405931Suche in Google Scholar
[2] Mezhennayaa N. M., Mikhailov V. G., “On the distribution of the number of ones in the output sequence of the MCV-generator over GF(2)”, Matematicheskie Voprosy Kriptografii, 4:4 (2013), 95–107 (in Russian).10.4213/mvk101Suche in Google Scholar
[3] Mezhennayaa N. M., “On distribution of number of ones in binary multicycle sequence”, Prikl. Diskr. Mat., 2015, № 1(27), 69–77 (in Russian).10.17223/20710410/27/7Suche in Google Scholar
[4] Bilyak I. B., Kamlovskii O. V., “Frequency characteristics of cycles in output sequences of combining generators over the field of two elements”, Prikl. Diskr. Mat., 2015, № 3(29), 17–31 (in Russian).10.17223/20710410/29/2Suche in Google Scholar
[5] Kamlovskii O. V., “Occurrence numbers for vectors in cycles of output sequences of binary combining generators”, Problems Inform. Transmission, 53 (2017), 84–91.10.1134/S0032946017010070Suche in Google Scholar
[6] Dictionary of cryptographic terms, ed. Pogorelov B. A., Sachkov V. N., MCCME, M., 2006 (in Russian), 50 pp.Suche in Google Scholar
[7] Logachev O. A., Sal’nikov A. A., Smyshlyaev S. V., Yashchenko V. V., Boolean functions in coding theory and cryptology, Mccme, M., 2012 (in Russian), 584 pp.10.1090/mmono/241Suche in Google Scholar
[8] Mezhennaya N. M., “Convergence rate estimators for the number of ones in outcome sequence of MCV generator with m- dependent registers items”, Sib. Electron. Math. Rep., 11 (2014), 18–25Suche in Google Scholar
[9] Sevastjanov B. A., “A class of limit distributions for quadratic forms from normal stochastic quantities”, Theory Probab. Appl., 6:3 (1961), 338–342.Suche in Google Scholar
[10] Springer M. D., Thompson W. E., “The distribution of products of beta, gamma and Gaussian random variables”, SIAM J. Appl. Math., 18:4 (1970), 721–737.10.1137/0118065Suche in Google Scholar
[11] Seidl’ L., “On limit distributions of random symmetric polynomials”, Theory Probab. Appl., 33:2 (1988), 248–259.10.1137/1133040Suche in Google Scholar
© 2020 Walter de Gruyter GmbH, Berlin/Boston
Artikel in diesem Heft
- Attribute-efficient learning of Boolean functions from Post closed classes
- Easily testable circuits in Zhegalkin basis in the case of constant faults of type “1” at gate outputs
- Post theorem for strongly dependent n-ary semigroups
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
- On the number of ones in outcome sequence of extended Pohl generator
- The number of sumsets in Abelian group
- Generalized allocation scheme with cell occupancies from a fixed finite set
- Universal functions for linear functions depending on two variables
Artikel in diesem Heft
- Attribute-efficient learning of Boolean functions from Post closed classes
- Easily testable circuits in Zhegalkin basis in the case of constant faults of type “1” at gate outputs
- Post theorem for strongly dependent n-ary semigroups
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
- On the number of ones in outcome sequence of extended Pohl generator
- The number of sumsets in Abelian group
- Generalized allocation scheme with cell occupancies from a fixed finite set
- Universal functions for linear functions depending on two variables
