G. Horváth, J. Lawrence, L. Mérai, Cs. Szabó, The complexity of the equivalence problem for nonsolvable groups, Bull. Lond. Math. Soc. 39 (2007), no. 3, 433-438.
G. Horváth, L. Mérai, The complexity of checking identities over non-solvable groups, (in Hungarian) Mat. Lapok 13 (2006/07), no. 2, 20-27 (2008).
L. Mérai, Construction of large families of pseudorandom binary sequences, Ramanujan J. 18 (2009), 341-349, the original publication is available at www.springerlink.com.
L. Mérai, A construction of pseudorandom binary sequences using rational functions, Unif. Distrib. Theory, 4 (2009), no. 1, 35-49.
L. Mérai, A construction of pseudorandom binary sequences using both additive and multiplicative characters, Acta Arith. 139 (2009), 241-252.
L. Mérai, Construction of pseudorandom binary lattices based on multiplicative characters, Periodica Math. Hungar. 59 (2009) 43-51.
L. Mérai, On finite pseudorandom lattices of k symbols, Monatsh. Math. 161 (2010), no. 2, 173-191.
L. Mérai, Construction of pseudorandom binary lattices using elliptic curves, Proc. Amer. Math. Soc. 139 (2011), no. 2, 407-420.
L. Mérai, Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters, Publ. Math. Debrecen, 80 (2012) no. 1-2, 199-213.
L. Mérai, Remarks on pseudorandom binary sequences over elliptic curves, Fund. Inform. 114 (2012) no. 3-4, 301-308.
M. Bárász, P. Ligeti, L. Mérai, D. A. Nagy, Anonymous sealed bid auction protocol based on a variant of the Dining Cryptographers' protocol, Periodica Math. Hungar. 65 (2012), no. 2, 167-176.
M. Bárász, P. Ligeti, K. Lónya, L. Mérai, D. A. Nagy, An another twist in the Dining Cryptographers' protocol, Tatra Mt. Math. Publ. 57 (2013) 85-99.
L. Mérai, The higher dimensional analogue of certain estimates of Roth and Sárközy, Periodica Math. Hungar. 68 (2014) 77-91.
L. Mérai, On the elliptic curve power generator, Unif. Distrib. Theory, 9 (2014) no. 2, 59-65.
L. Mérai, Pseudorandomness of binary sequences derived from linear recursions, Periodica Math. Hungar. 71 (2015) 64-77.
L. Mérai, O. Yayla, Improving results on the pseudorandomness of sequences generated via the additive order, Discrete Math. 338 (2015), 2020-2025.
L. Mérai, A. Winterhof, On the linear complexity profile of some sequences derived from elliptic curves, Des. Codes Cryptogr., 81 (2016) no. 2, 259-267, doi: 10.1007/s10623-015-0140-0
L. Mérai, A. Winterhof, On the pseudorandomness of the Liouville function of polynomials over a finite field, Unif. Distrib. Theory, 11 (2016), no. 1, 74-58.
L. Mérai, On the typical values of the cross-correlation measure, Monatsh. Math. 180 (2016) no. 1, 83-99, doi: 10.1007/s00605-016-0886-0
L. Mérai, H. Niederreiter, A. Winterhof, Expansion complexity and linear complexity of sequences over finite fields, Cryptogr. Commun. (2016) doi: 10.1007/s12095-016-0189-2
L. Mérai, The cross-correlation measure of families of finite binary sequences: limiting distributions and minimal values, Discrete Appl. Math. (2016) doi: 10.1016/j.dam.2016.06.024
L. Mérai, Predicting the elliptic curve congruential generator
M. Bárász, P. Ligeti, L. Mérai, D. Nagy, P. Sziklai Voting system P0700548, Hungarian patent, submission: 2007.
M. Bárász, P. Ligeti, K. Lója, L. Mérai, D. Nagy, P. Sziklai Bidding system P0700596, Hungarian patent, submission: 2007.