Construction of pseudorandom binary sequences using additive characters over GF(2ᵏ). II

DOI10.1007/S10998-010-2127-YMaRDI QIDQ624254zbMATH OpenOpenAlexFDO

Authors János Folláth

Publication date 8 February 2011

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

Full work available at URL https://doi.org/10.1007/s10998-010-2127-y

zbMATH Keywords

binary sequencecharacter sumspseudorandom binary sequencesnormality measure

Mathematics Subject Classification ID

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

Recommendations

• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
• Construction of pseudorandom binary sequences using additive characters
• On pseudorandom binary sequences constructed by using finite fields
• Measures of pseudorandomness for binary sequences constructed using finite fields
• On pseudorandom sequences of \(k\) symbols constructed using finite fields

Cites work

• scientific article; zbMATH DE number 1588467 (Why is no real title available?)
• scientific article; zbMATH DE number 5150220 (Why is no real title available?)
• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• A complexity measure for families of binary sequences
• Collision and avalanche effect in families of pseudorandom binary sequences
• Concatenation of pseudorandom binary sequences
• Construction of large families of pseudorandom binary sequences
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
• Linear complexity profile of binary sequences with small correlation measure
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol

Cited in

(10)

• Family complexity and VC-dimension
• A construction of pseudorandom binary sequences using both additive and multiplicative characters
• On binary linear codes and binary pseudo-random sequences
• Measures of pseudorandomness for binary sequences constructed using finite fields
• On the complexity of a family of Legendre sequences with irreducible polynomials
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
• On pseudorandom binary sequences constructed by using finite fields
• Pseudorandomness of binary sequences derived from linear recursions
• On pseudorandomness of families of binary sequences
• A new lower bound on the family complexity of Legendre sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q624254)