More constructions of pseudorandom lattices of \(k\) symbols
From MaRDI portal
Publication:2350677
DOI10.1007/s00605-014-0663-xzbMath1370.11096OpenAlexW1970052832MaRDI QIDQ2350677
Publication date: 25 June 2015
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-014-0663-x
Other character sums and Gauss sums (11T24) Well-distributed sequences and other variations (11K36) Pseudo-random numbers; Monte Carlo methods (11K45) Special sequences (11K31)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- On a problem of D.H. Lehmer and pseudorandom binary sequences
- Construction of pseudorandom binary lattices based on multiplicative characters
- On finite pseudorandom sequences of \(k\) symbols.
- Construction of pseudorandom binary sequences using additive characters
- On finite pseudorandom sequences of \(k\) symbols
- More constructions of pseudorandom sequences of \(k\) symbols
- Construction of pseudorandom binary lattices by using the multiplicative inverse
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- Construction of k-ary pseudorandom elliptic curve sequences
- Construction of pseudorandom binary lattices using elliptic curves
- On pseudorandom binary lattices
- A large family of pseudorandom binary lattices
- Bounds for exponential sums and their applications to pseudorandom numbers
- On the difference between a D. H. Lehmer number and its inverse modulo q
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Large families of pseudorandom binary sequences and lattices by using the multiplicative inverse
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
- A family of pseudorandom binary sequences constructed by the multiplicative inverse
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
- Some estimates for character sums and applications
- On finite pseudorandom lattices of \(k\) symbols
This page was built for publication: More constructions of pseudorandom lattices of \(k\) symbols
