Pages that link to "Item:Q987568"
From MaRDI portal
The following pages link to Construction of pseudorandom binary lattices based on multiplicative characters (Q987568):
Displaying 14 items.
- Pseudorandomness of binary sequences derived from linear recursions (Q313462) (← links)
- On finite pseudorandom binary lattices (Q516785) (← links)
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\) (Q1046743) (← links)
- Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields (Q2053545) (← links)
- Multidimensional linear complexity analysis of periodic arrays (Q2304655) (← links)
- More constructions of pseudorandom lattices of \(k\) symbols (Q2350677) (← links)
- Systems of congruences with products of variables from short intervals (Q2814334) (← links)
- Measures of pseudorandomness of families of binary lattices. I: Definitions, a construction using quadratic characters (Q2898849) (← 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)
- Large families of pseudorandom binary lattices by using the multiplicative inverse modulo P (Q4629107) (← links)
- (Q5037953) (← links)
- (Q5449223) (← links)
- (Q5496816) (← links)
