1 citations · 1 across the 2 of their papers we have counts for
15 papers
Character sums over sparse elements of finite fields
László Mérai, Igor E. Shparlinski, Arne Winterhof
We estimate mixed character sums of polynomial values over elements of a finite field with sparse representations in a fixed ordered basis over the subfield $\mat…
On divisors of sums of polynomials
László Mérai
Let and be sets of polynomials of degree over a finite field. We show, that if and are large enough, then has an i…
Pseudorandom sequences derived from automatic sequences
László Mérai, Arne Winterhof
Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a sm…
Linear complexity of some sequences derived from hyperelliptic curves of genus 2
Vishnupriya Anupindi, László Mérai
For a given hyperelliptic curve over a finite field with Jacobian , we consider the hyperelliptic analogue of the congruential generator defined by for $n\…
On functions with the maximal number of bent components
Nurdagül Anbar, Tekgül Kalaycı, Wilfried Meidl +1
A function , , can have at most bent component functions. Trivial examples are obtained as $F(x) = (f_1(x),\ldots,f_m(x)…
On the Dynamical System Generated by the Möbius transformation at Prime Times
László Mérai, Igor E. Shparlinski
We study the distribution of the sequence of elements of the discrete dynamical system generated by iterations of the Möbius map over a finite field of…