Construction of pseudorandom binary lattices based on multiplicative characters
From MaRDI portal
Publication:987568
DOI10.1007/S10998-009-9043-ZzbMATH Open1199.11104OpenAlexW2146642356MaRDI QIDQ987568FDOQ987568
Authors: László Mérai 
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
Recommendations
- Construction of pseudorandom binary lattices by using the multiplicative inverse
- Constructions of pseudorandom binary lattices
- A construction of pseudorandom binary sequences using both additive and multiplicative characters
- On pseudorandom binary lattices
- Large family of pseudorandom binary lattices by using the quadratic character in finite fields
- Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
- Construction of pseudorandom binary sequences using additive characters
- Pseudorandom binary sequences and lattices
- On finite pseudorandom binary lattices
Cites Work
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Construction of large families of pseudorandom binary sequences
- Some estimates for character sums and applications
- Construction of pseudorandom binary sequences using additive characters
- On pseudorandom binary lattices
- Title not available (Why is that?)
- On a family of pseudorandom binary sequences
- A note to the paper ``On a fast version of a pseudorandom generator
- A finite pseudorandom binary sequence
- On a Fast Version of a Pseudorandom Generator
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- Title not available (Why is that?)
- On pseudorandom properties of some Dirichlet characters
- Construction of pseudorandom binary lattices by using the multiplicative inverse
- Construction of large families of pseudorandom binary sequences
Cited In (14)
- Systems of congruences with products of variables from short intervals
- Pseudorandomness of binary sequences derived from linear recursions
- Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields
- Multidimensional linear complexity analysis of periodic arrays
- Measures of pseudorandomness of families of binary lattices. I: Definitions, a construction using quadratic characters
- Large families of pseudorandom binary lattices by using the multiplicative inverse modulo \(P\)
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Title not available (Why is that?)
- Construction of pseudorandom binary lattices using elliptic curves
- Title not available (Why is that?)
- A construction of pseudorandom binary sequences using both additive and multiplicative characters
- Title not available (Why is that?)
- More constructions of pseudorandom lattices of \(k\) symbols
- On finite pseudorandom binary lattices
This page was built for publication: Construction of pseudorandom binary lattices based on multiplicative characters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987568)
