Construction of pseudorandom binary sequences using additive characters
From MaRDI portal
Publication:1881645
DOI10.1007/s00605-003-0112-8zbMath1110.11024OpenAlexW2000044172MaRDI QIDQ1881645
Christian Mauduit, Joël Rivat, András Sárközy
Publication date: 5 October 2004
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-003-0112-8
Estimates on exponential sums (11L07) Irregularities of distribution, discrepancy (11K38) General theory of distribution modulo (1) (11K06) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (28)
GOWERS UNIFORMITY NORM AND PSEUDORANDOM MEASURES OF THE PSEUDORANDOM BINARY SEQUENCES ⋮ Pseudorandomness of binary sequences derived from linear recursions ⋮ Sequences related to Legendre/Jacobi sequences ⋮ On the correlation of families of pseudorandom sequences of $k$ symbols ⋮ The truncated sum-of-digits function of powers ⋮ On the correlation measures of subsets ⋮ Kloosterman sums with Beatty sequences and application ⋮ On the symmetry measure of pseudorandom subsets ⋮ More constructions of pseudorandom sequences of \(k\) symbols ⋮ Elliptic curve analogues of a pseudorandom generator ⋮ Extension of the notion of collision and avalanche effect to sequences of \(k\) symbols ⋮ Elliptic curve analogue of Legendre sequences ⋮ A note on certain modular constructions of pseudorandom binary sequences with composite moduli ⋮ On the complexity of families of pseudo-random subsets ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ On pseudorandomness of families of binary sequences ⋮ Construction of large families of pseudorandom binary sequences ⋮ 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 and pseudorandom binary sequences ⋮ A large family of pseudorandom binary lattices ⋮ On pseudo-random subsets of \({\mathbb{Z}}_n\) ⋮ Modified constructions of binary sequences using multiplicative inverse ⋮ Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\) ⋮ Concatenation of pseudorandom binary sequences ⋮ Large families of pseudorandom sequences of k symbols and their complexity, Part II ⋮ Large families of pseudorandom sequences of k symbols and their complexity, Part I ⋮ More constructions of pseudorandom lattices of \(k\) symbols
This page was built for publication: Construction of pseudorandom binary sequences using additive characters
