1 citations · 2 across the 3 of their papers we have counts for
7 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 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…
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…