English
Related papers

Related papers: On the periodic properties of self-decimated gener…

200 papers

The paper study counter-dependent pseudorandom generators; the latter are generators such that their state transition function (and output function) is being modified dynamically while working: For such a generator the recurrence sequence…

Cryptography and Security · Computer Science 2011-11-15 Vladimir Anashin

Empirical tests for pseudorandom number generators based on the use of processes or physical models have been successfuly used and are considered as complementary to theoretical test of randomness. In this work a statistical methodology for…

Computational Physics · Physics 2011-11-09 H. F. Coronel-Brizio , A. R. Hernandez-Montoya , M. A. Jimenez-Montano , L. E. Mora-Forsbach , .

This paper presents an expression to compute the exact period of a recursive random number generator based on d-sequences. Using the multi-recursive version of this generator we can produce large number of pseudorandom sequences.

Cryptography and Security · Computer Science 2007-12-05 Suresh Thippireddy , Sandeep Chalasani

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…

Cryptography and Security · Computer Science 2011-11-15 Vladimir Anashin

We investigate the periodic structure of the exponential pseudorandom number generator obtained from the map $x\mapsto g^x\pmod p$ that acts on the set $\{1, \ldots, p-1\}$.

Number Theory · Mathematics 2013-12-05 Jonas Kaszian , Pieter Moree , Igor E. Shparlinski

Pseudo-random number generators are widely used in many branches of science, mainly in applications related to Monte Carlo methods, although they are deterministic in design and, therefore, unsuitable for tackling fundamental problems in…

The behavior of a family of dissipative dynamical systems representing transformations of two-dimensional torus is studied on a discrete lattice and compared with that of conservative hyperbolic automorphisms of the torus. Applying…

Computational Physics · Physics 2011-06-21 L. Yu. Barash

The authors prove that the probability of choosing a nonlinear filter of m-sequences with optimal properties, that is, maximum period and maximum linear complexity, tends assymptotically to 1 as the linear feedback shift register length…

Cryptography and Security · Computer Science 2010-05-14 Amparo Fúster-Sabater , L. J. García-Villalba

We introduce several classes of pseudorandom sequences which represent a natural extension of classical methods in random number generation. The sequences are obtained from constructions on labeled binary trees, generalizing the well-known…

Combinatorics · Mathematics 2016-03-29 Josef Eschgfäller , Andrea Scarpante

An approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness…

Chaotic Dynamics · Physics 2009-11-13 Kai Wang , Wenjiang Pei , Haishan Xia , Yiu-ming Cheung

We present a new approach to constructing unconditional pseudorandom generators against classes of functions that involve computing a linear function of the inputs. We give an explicit construction of a pseudorandom generator that fools the…

Computational Complexity · Computer Science 2015-11-19 Parikshit Gopalan , Daniel Kane , Raghu Meka

Generating random and pseudorandom numbers with a deterministic system is a long-standing challenge in theoretical research and engineering applications. Several pseudorandom number generators based on the inversive congruential method have…

Discrete Mathematics · Computer Science 2024-01-17 Xiaoxiong Lu , Chengqing Li , Bo Zhou

We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…

Logic in Computer Science · Computer Science 2023-04-25 Jan Dreier , Jamie Tucker-Foltz

In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…

Number Theory · Mathematics 2023-05-22 Arne Winterhof

Iteration of the modular l-th power function f(x) = x^l (mod n) provides a common pseudorandom number generator (known as the Blum-Blum-Shub generator when l=2). The period of this pseudorandom number generator is closely related to…

Number Theory · Mathematics 2015-06-26 Greg Martin , Carl Pomerance

We present an iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and…

Computational Complexity · Computer Science 2012-10-02 Parikshit Gopalan , Raghu Meka , Omer Reingold , Luca Trevisan , Salil Vadhan

Let $\mu$ be the geometric realization on $[0,1]$ of a Gibbs measure on $\Sigma=\{0,1\}^{\mathbb{N}}$ associated with a H\"older potential. The thermodynamic and multifractal properties of $\mu$ are well known to be linked via the…

Mathematical Physics · Physics 2015-12-15 Julien Barral , Stéphane Seuret

We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating…

Number Theory · Mathematics 2017-10-10 László Mérai , Arne Winterhof

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…

Information Theory · Computer Science 2017-03-06 Kazuyoshi Tsuchiya , Yasuyuki Nogami

In this paper, we focus on analyzing the period distribution of the inversive pseudorandom number generators (IPRNGs) over finite field $({\rm Z}_{N},+,\times)$, where $N>3$ is a prime. The sequences generated by the IPRNGs are transformed…

Information Theory · Computer Science 2012-09-07 Bo Zhou , Qiankun Song
‹ Prev 1 2 3 10 Next ›