Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)

DOI10.1007/s10998-008-7073-1zbMath1199.68129OpenAlexW2038931052MaRDI QIDQ1046743

János Folláth

Publication date: 28 December 2009

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-008-7073-1

zbMATH Keywords

character sumsbinary sequencepseudorandomnormality measure

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Exponential sums (11T23)

Related Items (6)

Pseudorandomness of binary sequences derived from linear recursions ⋮ On pseudorandom binary sequences constructed by using finite fields ⋮ Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure ⋮ Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II ⋮ On pseudorandomness of families of binary sequences ⋮ Family Complexity and VC-Dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Collision and avalanche effect in families of pseudorandom binary sequences
• Equations over finite fields. An elementary approach
• A complexity measure for families of binary sequences
• Construction of pseudorandom binary sequences using additive characters
• Linear complexity profile of binary sequences with small correlation measure
• Construction of pseudorandom binary sequences by using the multiplicative inverse
• Estimates for Character Sums
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• A finite pseudorandom binary sequence
• On linear recursion and pseudorandomness
• Construction of large families of pseudorandom binary sequences

This page was built for publication: Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)