122 research outputs found
Full Orbit Sequences in Affine Spaces via Fractional Jumps and Pseudorandom Number Generation
Let be a positive integer. In this paper we provide a general theory to
produce full orbit sequences in the affine -dimensional space over a finite
field. For our construction covers the case of the Inversive Congruential
Generators (ICG). In addition, for we show that the sequences produced
using our construction are easier to compute than ICG sequences. Furthermore,
we prove that they have the same discrepancy bounds as the ones constructed
using the ICG.Comment: To appear in Mathematics of Computatio
On the Degree Growth in Some Polynomial Dynamical Systems and Nonlinear Pseudorandom Number Generators
In this paper we study a class of dynamical systems generated by iterations
of multivariate polynomials and estimate the degreegrowth of these iterations.
We use these estimates to bound exponential sums along the orbits of these
dynamical systems and show that they admit much stronger estimates than in the
general case and thus can be of use for pseudorandom number generation.Comment: Mathematics of Computation (to appear
On Some Dynamical Systems in Finite Fields and Residue Rings
We use character sums to confirm several recent conjectures of V. I. Arnold
on the uniformity of distribution properties of a certain dynamical system in a
finite field. On the other hand, we show that some conjectures are wrong. We
also analyze several other conjectures of V. I. Arnold related to the orbit
length of similar dynamical systems in residue rings and outline possible ways
to prove them. We also show that some of them require further tuning
On lattice profile of the elliptic curve linear congruential generators
Lattice tests are quality measures for assessing the intrinsic structure of pseudorandom number generators. Recently a new lattice test has been introduced by Niederreiter and Winterhof. In this paper, we present a general inequality that is satisfied by any periodic sequence. Then, we analyze the behavior of the linear congruential generators on elliptic curves (EC-LCG) under this new lattice test and prove that the EC-LCG passes it up to very high dimensions. We also use a result of Brandstätter and Winterhof on the linear complexity profile related to the correlation measure of order k to present lower bounds on the linear complexity profile of some binary sequences derived from the EC-LCG
Periodic orbits of the ensemble of Sinai-Arnold cat maps and pseudorandom number generation
We propose methods for constructing high-quality pseudorandom number
generators (RNGs) based on an ensemble of hyperbolic automorphisms of the unit
two-dimensional torus (Sinai-Arnold map or cat map) while keeping a part of the
information hidden. The single cat map provides the random properties expected
from a good RNG and is hence an appropriate building block for an RNG, although
unnecessary correlations are always present in practice. We show that
introducing hidden variables and introducing rotation in the RNG output,
accompanied with the proper initialization, dramatically suppress these
correlations. We analyze the mechanisms of the single-cat-map correlations
analytically and show how to diminish them. We generalize the Percival-Vivaldi
theory in the case of the ensemble of maps, find the period of the proposed RNG
analytically, and also analyze its properties. We present efficient practical
realizations for the RNGs and check our predictions numerically. We also test
our RNGs using the known stringent batteries of statistical tests and find that
the statistical properties of our best generators are not worse than those of
other best modern generators.Comment: 18 pages, 3 figures, 9 table
Fractional jumps: complete characterisation and an explicit infinite family
In this paper we provide a complete characterisation of transitive fractional
jumps by showing that they can only arise from transitive projective
automorphisms. Furthermore, we prove that such construction is feasible for
arbitrarily large dimension by exhibiting an infinite class of projectively
primitive polynomials whose companion matrix can be used to define a full orbit
sequence over an affine space
- …