Construction of pseudorandom binary lattices based on multiplicative characters
From MaRDI portal
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
- scientific article; zbMATH DE number 5619271 (Why is no real title available?)
- scientific article; zbMATH DE number 5247160 (Why is no real title available?)
- A finite pseudorandom binary sequence
- A note to the paper ``On a fast version of a pseudorandom generator
- Construction of large families of pseudorandom binary sequences
- Construction of large families of pseudorandom binary sequences
- Construction of pseudorandom binary lattices by using the multiplicative inverse
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- Construction of pseudorandom binary sequences using additive characters
- On a Fast Version of a Pseudorandom Generator
- On a family of pseudorandom binary sequences
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On pseudorandom binary lattices
- On pseudorandom properties of some Dirichlet characters
- Some estimates for character sums and applications
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
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Large families of pseudorandom binary lattices by using the multiplicative inverse modulo \(P\)
- scientific article; zbMATH DE number 5247160 (Why is no real title available?)
- Construction of pseudorandom binary lattices using elliptic curves
- scientific article; zbMATH DE number 7594564 (Why is no real title available?)
- A construction of pseudorandom binary sequences using both additive and multiplicative characters
- More constructions of pseudorandom lattices of \(k\) symbols
- scientific article; zbMATH DE number 6391998 (Why is no real title available?)
- 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)