Construction of pseudorandom binary lattices based on multiplicative characters. - László Mérai (Period. Math. Hung., 2009)

Remarks on Pseudorandom Binary Sequences Over Elliptic Curves. - László Mérai (Fundam. Informaticae, 2012)

Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol. - Mihály Bárász; Péter Ligeti; László Mérai; Daniel A. Nagy (Period. Math. Hung., 2012)

The higher dimensional analogue of certain estimates of Roth and Sárközy. - László Mérai (Period. Math. Hung., 2014)

Improving results on the pseudorandomness of sequences generated via the additive order of a finite field. - László Mérai; Oguz Yayla (Discret. Math., 2015)

Pseudorandomness of binary sequences derived from linear recursions. - László Mérai (Period. Math. Hung., 2015)

On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve. - László Mérai (WAIFI, 2016)

The cross-correlation measure of families of finite binary sequences: Limiting distributions and minimal values. - László Mérai (Discret. Appl. Math., 2016)

On the linear complexity profile of some sequences derived from elliptic curves. - László Mérai; Arne Winterhof (Des. Codes Cryptogr., 2016)

The Measures of Pseudorandomness and the NIST Tests. - László Mérai; Joël Rivat; András Sárközy (NuTMiC, 2017)

Predicting the elliptic curve congruential generator. - László Mérai (Appl. Algebra Eng. Commun. Comput., 2017)

Expansion complexity and linear complexity of sequences over finite fields. - László Mérai; Harald Niederreiter; Arne Winterhof (Cryptogr. Commun., 2017)

On the pseudorandomness of automatic sequences. - László Mérai; Arne Winterhof (Cryptogr. Commun., 2018)

On the elliptic curve endomorphism generator. - László Mérai (Des. Codes Cryptogr., 2018)

Identity testing and interpolation from high powers of polynomials of large degree over finite fields. - Marek Karpinski; László Mérai; Igor E. Shparlinski (J. Complex., 2018)

On the Expansion Complexity of Sequences Over Finite Fields. - Domingo Gómez-Pérez; László Mérai; Harald Niederreiter (IEEE Trans. Inf. Theory, 2018)

Algebraic dependence in generating functions and expansion complexity. - Domingo Gómez-Pérez; László Mérai (Adv. Math. Commun., 2020)

On functions with the maximal number of bent components. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl; László Mérai (CoRR, 2020)

On the complexity of exact counting of dynamically irreducible polynomials. - Domingo Gómez-Pérez; László Mérai; Igor E. Shparlinski (J. Symb. Comput., 2020)

Distribution of short subsequences of inversive congruential pseudorandom numbers modulo 2t. - László Mérai; Igor E. Shparlinski (Math. Comput., 2020)

Linear complexity of some sequences derived from hyperelliptic curves of genus 2. - Vishnupriya Anupindi; László Mérai (Cryptogr. Commun., 2022)

Pseudorandom sequences derived from automatic sequences. - László Mérai; Arne Winterhof (Cryptogr. Commun., 2022)

On divisors of sums of polynomials. - László Mérai (Finite Fields Their Appl., 2022)

On a Class of Functions With the Maximal Number of Bent Components. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl; László Mérai (IEEE Trans. Inf. Theory, 2022)

Distribution of recursive matrix pseudorandom number generator modulo prime powers. - László Mérai; Igor E. Shparlinski (Math. Comput., 2023)