On linear recursion and pseudorandomness
From MaRDI portal
Publication:5315177
DOI10.4064/aa118-4-3zbMath1081.11055OpenAlexW2081314255MaRDI QIDQ5315177
Katalin Gyarmati, András Sárközy, Attila Pethoe
Publication date: 7 September 2005
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/aa118-4-3
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Exponential sums (11T23) Estimates on character sums (11L40) Well-distributed sequences and other variations (11K36) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (6)
MULTIPLICATIVE CHARACTER SUMS OF A CLASS OF NONLINEAR RECURRENCE VECTOR SEQUENCES ⋮ Pseudorandomness of binary sequences derived from linear recursions ⋮ Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure ⋮ Elliptic curve analogues of a pseudorandom generator ⋮ Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\) ⋮ Concatenation of pseudorandom binary sequences
This page was built for publication: On linear recursion and pseudorandomness
