20 citations · 28 across the 9 of their papers we have counts for
4 papers · 1 filter
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…