Construction of pseudorandom binary lattices by using the multiplicative inverse

DOI10.1007/s00605-007-0479-zzbMath1137.11050OpenAlexW2033425408MaRDI QIDQ2482218

Christian Mauduit, András Sárközy

Publication date: 16 April 2008

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00605-007-0479-z

zbMATH Keywords

finite fieldspseudorandomnessbinary latticemultiplicative inverseincomplete additive character sums

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (12)

The truncated sum-of-digits function of powers ⋮ 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 based on multiplicative characters ⋮ A family of elliptic curve pseudorandom binary sequences ⋮ On finite pseudorandom lattices of \(k\) symbols ⋮ A large family of pseudorandom binary lattices ⋮ Construction of pseudorandom binary lattices using elliptic curves ⋮ 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

• Construction of pseudorandom binary sequences by using the multiplicative inverse
• Character sums and primitive roots in finite fields
• EXPONENTIAL SUMS AND THE DISTRIBUTION OF INVERSIVE CONGRUENTIAL PSEUDORANDOM NUMBERS WITH POWER OF TWO MODULUS
• New pseudorandom sequences constructed using multiplicative inverses
• On pseudorandom binary lattices

This page was built for publication: Construction of pseudorandom binary lattices by using the multiplicative inverse