20 citations · 28 across the 9 of their papers we have counts for
11 papers
Distribution of short subsequences of inversive congruential pseudorandom numbers modulo
László Mérai, Igor E. Shparlinski
In this paper we study the distribution of very short sequences of inversive congruential pseudorandom numbers modulo . We derive a new bound on exponential sums with such seq…
The measures of pseudorandomness and the NIST tests
László Mérai, Joël Rivat, András Sárközy
A few years ago new quantitative measures of pseudorandomness of binary sequences have been introduced. Since that these measures have been studied in many papers and many construc…
On the pseudorandomness of automatic sequences
László Mérai, Arne Winterhof
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 fro…
On the elliptic curve endomorphism generator
László Mérai
For an elliptic curve over a finite field we define the point sequence recursively by with an endomorphism $\vartheta \in\ma…
On the Complexity of Exact Counting of Dynamically Irreducible Polynomials
Domingo Gómez-Pérez, László Mérai, Igor E. Shparlinski
We give an efficient algorithm to enumerate all sets of quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
On the expansion complexity of sequences over finite fields
Gómez-Pérez, László Mérai, Harald Niederreiter
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irredu…
Predicting the elliptic curve congruential generator
László Mérai
Let be a prime and let be an elliptic curve defined over the finite field of elements. For a point the elliptic c…
The cross-correlation measure of families of finite binary sequences: limiting distributions and minimal values
László Mérai
Gyarmati, Mauduit and Sárközy introduced the cross-correlation measure of order to measure the level of pseudorandom properties of families of finite binary sequences.…
Expansion complexity and linear complexity of sequences over finite fields
László Mérai, Harald Niederreiter, Arne Winterhof
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of…
On the typical values of the cross-correlation measure
László Mérai
Gyarmati, Mauduit and Sárközy introduced the \textit{cross-correlation measure} to measure the randomness of families of binary sequences $\mathcal{F} \subset \{…
On the linear complexity profile of some sequences derived from elliptic curves
László Mérai, Arne Winterhof
For a given elliptic curve over a finite field of odd characteristic and a rational function on we first study the linear complexity profiles of the s…