The following pages link to László Mérai (Q244539):
Displaying 47 items.
- On the typical values of the cross-correlation measure (Q284078) (← links)
- On the linear complexity profile of some sequences derived from elliptic curves (Q306337) (← links)
- Pseudorandomness of binary sequences derived from linear recursions (Q313462) (← links)
- The cross-correlation measure of families of finite binary sequences: limiting distributions and minimal values (Q317423) (← links)
- Expansion complexity and linear complexity of sequences over finite fields (Q517722) (← links)
- Construction of pseudorandom binary lattices based on multiplicative characters (Q987568) (← links)
- On the pseudorandomness of automatic sequences (Q1667443) (← links)
- On the elliptic curve endomorphism generator (Q1744020) (← links)
- On the \(N\)th linear complexity of automatic sequences (Q1747239) (← links)
- Identity testing and interpolation from high powers of polynomials of large degree over finite fields (Q1791682) (← links)
- Dynamical irreducibility of polynomials modulo primes (Q2043070) (← links)
- On digits of Mersenne numbers (Q2104853) (← links)
- Linear complexity of some sequences derived from hyperelliptic curves of genus 2 (Q2130031) (← links)
- Pseudorandom sequences derived from automatic sequences (Q2154881) (← links)
- On divisors of sums of polynomials (Q2168948) (← links)
- Algebraic dependence in generating functions and expansion complexity (Q2176295) (← links)
- On the dynamical system generated by the Möbius transformation at prime times (Q2226537) (← links)
- Unlikely intersections over finite fields: polynomial orbits in small subgroups (Q2281606) (← links)
- On the complexity of exact counting of dynamically irreducible polynomials (Q2284970) (← links)
- Improving results on the pseudorandomness of sequences generated via the additive order of a finite field (Q2352068) (← links)
- Predicting the elliptic curve congruential generator (Q2363380) (← links)
- Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol (Q2392053) (← links)
- The higher dimensional analogue of certain estimates of Roth and Sárközy (Q2453819) (← links)
- The measures of pseudorandomness and the NIST tests (Q2636471) (← links)
- On the Pseudorandomness of the Liouville Function of Polynomials over a Finite Field (Q2835471) (← links)
- (Q2883173) (← links)
- Construction of pseudorandom binary lattices using elliptic curves (Q3082310) (← links)
- A construction of pseudorandom binary sequences using both additive and multiplicative characters (Q3184348) (← links)
- (Q3184622) (← links)
- (Q3448499) (← links)
- (Q3617668) (← links)
- Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure (Q4581331) (← links)
- On a Class of Functions With the Maximal Number of Bent Components (Q5040012) (← links)
- Multiplicative and Linear Dependence in Finite Fields and on Elliptic Curves Modulo Primes (Q5046086) (← links)
- On the distribution of the Rudin-Shapiro function for finite fields (Q5157778) (← links)
- Distribution of short subsequences of inversive congruential pseudorandom numbers modulo $2^t$ (Q5207446) (← links)
- Values of rational functions in small subgroups of finite fields and the identity testing problem from powers (Q5221454) (← links)
- On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve (Q5267792) (← links)
- On the Expansion Complexity of Sequences Over Finite Fields (Q5375572) (← links)
- Sparsity of curves and additive and multiplicative expansion of rational maps over finite fields (Q5376590) (← links)
- ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS’ PROTOCOL (Q5402657) (← links)
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters (Q5420910) (← links)
- Construction of large families of pseudorandom binary sequences (Q5902183) (← links)
- On finite pseudorandom lattices of \(k\) symbols (Q5962362) (← links)
- Distribution of recursive matrix pseudorandom number generator modulo prime powers (Q6203467) (← links)
- Character sums over sparse elements of finite fields (Q6203676) (← links)
- Multiplicative and linear dependence in finite fields and on elliptic curves modulo primes (Q6346310) (← links)
