Construction of pseudorandom binary lattices based on multiplicative characters
From MaRDI portal
Publication:987568
DOI10.1007/s10998-009-9043-zzbMath1199.11104OpenAlexW2146642356MaRDI QIDQ987568
Publication date: 13 August 2010
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-009-9043-z
Related Items (9)
Pseudorandomness of binary sequences derived from linear recursions ⋮ Large families of pseudorandom binary lattices by using the multiplicative inverse modulo P ⋮ Unnamed Item ⋮ On finite pseudorandom binary lattices ⋮ Construction of pseudorandom binary lattices using elliptic curves ⋮ SYSTEMS OF CONGRUENCES WITH PRODUCTS OF VARIABLES FROM SHORT INTERVALS ⋮ Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields ⋮ Multidimensional linear complexity analysis of periodic arrays ⋮ More constructions of pseudorandom lattices of \(k\) symbols
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of pseudorandom binary sequences using additive characters
- On pseudorandom properties of some Dirichlet characters
- Construction of pseudorandom binary lattices by using the multiplicative inverse
- On a family of pseudorandom binary sequences
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- On pseudorandom binary lattices
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- A finite pseudorandom binary sequence
- On a Fast Version of a Pseudorandom Generator
- Construction of large families of pseudorandom binary sequences
- Construction of large families of pseudorandom binary sequences
- Some estimates for character sums and applications
This page was built for publication: Construction of pseudorandom binary lattices based on multiplicative characters
