default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLászló Mérai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]László Mérai, Igor E. Shparlinski:
Distribution of recursive matrix pseudorandom number generator modulo prime powers. Math. Comput. 93(347): 1355-1370 (2023)- 2022
- [j21]Vishnupriya Anupindi
, László Mérai:
Linear complexity of some sequences derived from hyperelliptic curves of genus 2. Cryptogr. Commun. 14(1): 117-134 (2022) - [j20]László Mérai, Arne Winterhof:
Pseudorandom sequences derived from automatic sequences. Cryptogr. Commun. 14(4): 783-815 (2022) - [j19]László Mérai:
On divisors of sums of polynomials. Finite Fields Their Appl. 83: 102090 (2022) - [j18]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl, László Mérai:
On a Class of Functions With the Maximal Number of Bent Components. IEEE Trans. Inf. Theory 68(9): 6174-6186 (2022) - 2021
- [i5]Vishnupriya Anupindi, László Mérai:
Linear complexity of some sequences derived from hyperelliptic curves of genus 2. CoRR abs/2102.02605 (2021) - [i4]László Mérai, Arne Winterhof:
Pseudorandom sequences derived from automatic sequences. CoRR abs/2105.03086 (2021) - 2020
- [j17]Domingo Gómez-Pérez, László Mérai:
Algebraic dependence in generating functions and expansion complexity. Adv. Math. Commun. 14(2): 307-318 (2020) - [j16]Domingo Gómez-Pérez, László Mérai, Igor E. Shparlinski:
On the complexity of exact counting of dynamically irreducible polynomials. J. Symb. Comput. 99: 231-241 (2020) - [j15]László Mérai, Igor E. Shparlinski:
Distribution of short subsequences of inversive congruential pseudorandom numbers modulo 2t. Math. Comput. 89(322): 911-922 (2020) - [i3]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl, László Mérai:
On functions with the maximal number of bent components. CoRR abs/2010.03801 (2020)
2010 – 2019
- 2018
- [j14]László Mérai, Arne Winterhof:
On the pseudorandomness of automatic sequences. Cryptogr. Commun. 10(6): 1013-1022 (2018) - [j13]László Mérai:
On the elliptic curve endomorphism generator. Des. Codes Cryptogr. 86(5): 1113-1129 (2018) - [j12]Marek Karpinski, László Mérai, Igor E. Shparlinski:
Identity testing and interpolation from high powers of polynomials of large degree over finite fields. J. Complex. 49: 74-84 (2018) - [j11]Domingo Gómez-Pérez, László Mérai, Harald Niederreiter:
On the Expansion Complexity of Sequences Over Finite Fields. IEEE Trans. Inf. Theory 64(6): 4228-4232 (2018) - 2017
- [j10]László Mérai:
Predicting the elliptic curve congruential generator. Appl. Algebra Eng. Commun. Comput. 28(3): 193-203 (2017) - [j9]László Mérai, Harald Niederreiter, Arne Winterhof:
Expansion complexity and linear complexity of sequences over finite fields. Cryptogr. Commun. 9(4): 501-509 (2017) - [c2]László Mérai, Joël Rivat, András Sárközy:
The Measures of Pseudorandomness and the NIST Tests. NuTMiC 2017: 197-216 - [i2]Domingo Gómez-Pérez, László Mérai, Igor E. Shparlinski:
On the Complexity of Exact Counting of Dynamically Irreducible Polynomials. CoRR abs/1706.04392 (2017) - 2016
- [j8]László Mérai:
The cross-correlation measure of families of finite binary sequences: Limiting distributions and minimal values. Discret. Appl. Math. 214: 153-168 (2016) - [j7]László Mérai, Arne Winterhof:
On the linear complexity profile of some sequences derived from elliptic curves. Des. Codes Cryptogr. 81(2): 259-267 (2016) - [c1]László Mérai:
On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve. WAIFI 2016: 54-63 - [i1]László Mérai:
Predicting the elliptic curve congruential generator. CoRR abs/1609.03305 (2016) - 2015
- [j6]László Mérai, Oguz Yayla:
Improving results on the pseudorandomness of sequences generated via the additive order of a finite field. Discret. Math. 338(11): 2020-2025 (2015) - [j5]László Mérai:
Pseudorandomness of binary sequences derived from linear recursions. Period. Math. Hung. 71(1): 64-77 (2015) - 2014
- [j4]László Mérai:
The higher dimensional analogue of certain estimates of Roth and Sárközy. Period. Math. Hung. 68(1): 77-91 (2014) - 2012
- [j3]László Mérai:
Remarks on Pseudorandom Binary Sequences Over Elliptic Curves. Fundam. Informaticae 114(3-4): 301-308 (2012) - [j2]Mihály Bárász, Péter Ligeti, László Mérai, Daniel A. Nagy:
Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol. Period. Math. Hung. 65(2): 167-176 (2012)
2000 – 2009
- 2009
- [j1]László Mérai:
Construction of pseudorandom binary lattices based on multiplicative characters. Period. Math. Hung. 59(1): 43-51 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
