Pages that link to "Item:Q4780298"
From MaRDI portal
The following pages link to A finite pseudorandom binary sequence (Q4780298):
Displaying 20 items.
- Elliptic curve analogues of a pseudorandom generator (Q452828) (← links)
- On the complexity of families of pseudo-random subsets (Q486751) (← links)
- On finite pseudorandom binary lattices (Q516785) (← links)
- On a problem of D.H. Lehmer and pseudorandom binary sequences (Q734064) (← links)
- Construction of pseudorandom binary lattices based on multiplicative characters (Q987568) (← links)
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\) (Q1046743) (← links)
- A complexity measure for families of binary sequences (Q1878610) (← links)
- On the pseudo-randomness of subsets related to primitive roots (Q1945263) (← links)
- A new lower bound on the family complexity of Legendre sequences (Q2121576) (← links)
- On the correlation measures of subsets (Q2189560) (← links)
- Sequences related to Legendre/Jacobi sequences (Q2384834) (← links)
- On pseudorandom properties of some Dirichlet characters (Q2426704) (← links)
- On pseudorandomness in families of sequences derived from the Legendre symbol (Q2460689) (← links)
- On pseudo-random subsets of the set of the integers not exceeding \(N\) (Q2460691) (← links)
- Construction of pseudorandom binary lattices using elliptic curves (Q3082310) (← links)
- Pseudorandom sequences of binary vectors (Q3510002) (← links)
- Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves (Q3600337) (← links)
- A large family of pseudorandom binary lattices (Q3617565) (← links)
- (Q5558260) (← links)
- Construction of large families of pseudorandom binary sequences (Q5907098) (← links)
