Measures of pseudorandomness for binary sequences constructed using finite fields

DOI10.1016/j.disc.2008.01.056zbMath1178.11054OpenAlexW1987223055MaRDI QIDQ1024437

András Sárközy, Arne Winterhof

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.056

zbMATH Keywords

correlationsequencesfinite fieldspseudorandomnesswell-distribution

Mathematics Subject Classification ID

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

Related Items (5)

MULTIPLICATIVE CHARACTER SUMS OF A CLASS OF NONLINEAR RECURRENCE VECTOR SEQUENCES ⋮ On pseudorandom binary sequences constructed by using finite fields ⋮ On pseudorandom sequences of \(k\) symbols constructed using finite fields ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields ⋮ Improving results on the pseudorandomness of sequences generated via the additive order of a finite field

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the distribution of powers in finite fields
• On the measures of pseudorandomness of binary sequences.
• Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Lower bounds on the linear complexity of the discrete logarithm in finite fields
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• Measures of pseudorandomness for finite sequences: typical values
• Construction of large families of pseudorandom binary sequences
• Some estimates for character sums and applications

This page was built for publication: Measures of pseudorandomness for binary sequences constructed using finite fields