Construction of pseudorandom binary sequences by using the multiplicative inverse
From MaRDI portal
Publication:2568523
DOI10.1007/s10474-005-0222-yzbMath1102.11038OpenAlexW2056143252MaRDI QIDQ2568523
Christian Mauduit, András Sárközy
Publication date: 27 June 2006
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10474-005-0222-y
Polynomials in number theory (11C08) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (20)
GOWERS UNIFORMITY NORM AND PSEUDORANDOM MEASURES OF THE PSEUDORANDOM BINARY SEQUENCES ⋮ The truncated sum-of-digits function of powers ⋮ On the correlation measures of subsets ⋮ More constructions of pseudorandom sequences of \(k\) symbols ⋮ Exponential sums with Piatetski-Shapiro sequences and their application to modular hyperbolas ⋮ On the Structure of Inversive Pseudorandom Number Generators ⋮ A note on certain modular constructions of pseudorandom binary sequences with composite moduli ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ On pseudo-random subsets of the set of the integers not exceeding \(N\) ⋮ Construction of large families of pseudorandom binary sequences ⋮ Construction of pseudorandom binary lattices by using the multiplicative inverse ⋮ On large families of subsets of the set of the integers not exceeding \(N\) ⋮ Construction of pseudorandom binary lattices based on multiplicative characters ⋮ On a problem of D. H. Lehmer ⋮ On a problem of D.H. Lehmer and pseudorandom binary sequences ⋮ A large family of pseudorandom binary lattices ⋮ Construction of pseudorandom binary lattices using elliptic curves ⋮ Modified constructions of binary sequences using multiplicative inverse ⋮ Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\) ⋮ More constructions of pseudorandom lattices of \(k\) symbols
This page was built for publication: Construction of pseudorandom binary sequences by using the multiplicative inverse