English

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

Cryptography and Security 2011-11-15 v1

Abstract

The paper study counter-dependent pseudorandom number generators based on mm-variate (m>1m>1) ergodic mappings of the space of 2-adic integers Z2\Z_2. The sequence of internal states of these generators is defined by the recurrence law xi+1=HiB(xi)mod2n\mathbf x_{i+1}= H^B_i(\mathbf x_i)\bmod{2^n}, whereas their output sequence is %while its output sequence is of the zi=FiB(xi)mod2n\mathbf z_{i}=F^B_i(\mathbf x_i)\mod 2^n; here xj,zj\mathbf x_j, \mathbf z_j are mm-dimensional vectors over Z2\Z_2. It is shown how the results obtained for a univariate case could be extended to a multivariate case.

Keywords

Cite

@article{arxiv.cs/0402060,
  title  = {Pseudorandom number generation by p-adic ergodic transformations: an addendum},
  author = {Vladimir Anashin},
  journal= {arXiv preprint arXiv:cs/0402060},
  year   = {2011}
}

Comments

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