Pseudorandom number generation by p-adic ergodic transformations: an addendum

Abstract

The paper study counter-dependent pseudorandom number generators based on $m$-variate ($m>1$) ergodic mappings of the space of 2-adic integers ${\mathbb{Z}}_2$. The sequence of internal states of these generators is defined by the recurrence law ${\mathbf{x}}_{i+1}=H_i^B({\mathbf{x}}_i)\mathrm{mod}{2}^n$, whereas their output sequence is %while its output sequence is of the ${\mathbf{z}}_i=F_i^B({\mathbf{x}}_i)\mathrm{mod}{2}^n$; here ${\mathbf{x}}_j,{\mathbf{z}}_j$ are $m$-dimensional vectors over ${\mathbb{Z}}_2$. It is shown how the results obtained for a univariate case could be extended to a multivariate case.

9 pages, no figures, LaTeX 2e. An addendum to an earlier posting

References in corpus (3)

• Uniformly distributed sequences of p-adic integers, II
• Guaranteeing the diversity of number generators
• Pseudorandom number generation by $p$-adic ergodic transformations

Cited by in corpus (3)

• Non-Archimedean Ergodic Theory and Pseudorandom Generators
• Wreath Products in Stream Cipher Design
• Non-Archimedean analysis, T-functions, and cryptography