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

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Scientific paper

The paper study counter-dependent pseudorandom number generators based on $m$-variate ($m>1$) ergodic mappings of the space of 2-adic integers $\Z_2$. The sequence of internal states of these generators is defined by the recurrence law $\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 $\mathbf z_{i}=F^B_i(\mathbf x_i)\mod 2^n$; here $\mathbf x_j, \mathbf z_j$ are $m$-dimensional vectors over $\Z_2$. It is shown how the results obtained for a univariate case could be extended to a multivariate case.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Pseudorandom number generation by p-adic ergodic transformations: an addendum does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pseudorandom number generation by p-adic ergodic transformations: an addendum, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudorandom number generation by p-adic ergodic transformations: an addendum will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-130090

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.