Related papers: Periodic Structure of the Exponential Pseudorandom…
In this note, we give a practical solution to the problem of determining the maximal period of matrix generators of pseudo-random numbers which are based on an integer-valued unimodular matrix of size NxN known as MIXMAX and arithmetic…
We introduce new families of enhanced chaotic number generators in order to compute very fast long series of pseudorandom numbers. The key feature of these generators being the use of chaotic numbers themselves for sampling chaotic…
We obtain some theoretic and experimental results concerning various properties (the number of fixed points, image distribution, cycle lengths) of the dynamical system naturally associated with Fermat quotients acting on the set $\{0, ...,…
This work considers the deployment of pseudo-random number generators (PRNGs) on graphics processing units (GPUs), developing an approach based on the xorgens generator to rapidly produce pseudo-random numbers of high statistical quality.…
The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions…
We give a new practical method for computing subvarieties of projective hypersurfaces. By computing the periods of a given hypersurface X, we find algebraic cohomology cycles on X. On well picked algebraic cycles, we can then recover the…
The aim of this paper is to present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure, passes all of the usual statistical tests referenced in the literature and hence generates high quality random…
In this paper we investigate how many periodic attractors maps in a small neighbourhood of a given map can have. For this purpose we develop new tools which help to make uniform cross-ratio distortion estimates in a neighbourhood of a map…
A recursive random number generator using prime reciprocals is described.
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
We study the distribution of the sequence of elements of the discrete dynamical system generated by iterations of the M\"obius map $x \mapsto (ax + b)/(cx+d)$ over a finite field of $p$ elements at the moments of time that correspond to…
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…
In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…
We proposed the deep zoom analysis of the composition of the logistic map and the tent map, which are well-known discrete unimodal chaotic maps. The deep zoom technique transforms each point of a given chaotic orbit by removing its first…
Hopf algebra structures on the extended q-superplane and its differential algebra are defined. An algebra of forms which are obtained from the generators of the extended q-superplane is introduced and its Hopf algebra structure is given
This project develops a pseudo-random number generator (PRNG) using the logistic map, implemented in Verilog HDL on an FPGA and processes its output through a Central Limit Theorem (CLT) function to achieve a Gaussian distribution. The…
We explore the implementation of pseudo-random single-qubit rotations and multi-qubit pseudo-random circuits constructed only from Clifford gates and the T-gate, a phase rotation of pi/4. Such a gate set would be appropriate for…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
Pseudorandom number generators have been widely used in Monte Carlo methods, communication systems, cryptography and so on. For cryptographic applications, pseudorandom number generators are required to generate sequences which have good…
Self-inducing structure of pentagonal piecewise isometry is applied to show detailed description of periodic and aperiodic orbits, and further dynamical properties. A Pisot number appears as a scaling constant and plays a crucial role in…