Boolean functions derived from pseudorandom binary sequences

DOI10.1007/978-3-642-30615-0_9MaRDI QIDQ2907281zbMATH OpenOpenAlexFDO

Authors Arne Winterhof, Gottlieb Pirsic

Publication date 7 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30615-0_9

zbMATH Keywords

sparsitycryptographynonlinearitypseudorandomnessBoolean functionscorrelation measurecombinatorial complexity

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Correlation measure, linear complexity and maximum order complexity for families of binary sequences
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• A large family of Boolean functions
• \(r\)-th order nonlinearity, correlation measure and least significant bit of the discrete logarithm
• Linear complexity profile of binary sequences with small correlation measure

Cited in

(6)

• Linear complexity profile of binary sequences with small correlation measure
• On Boolean Functions Defined on Bracket Sequences
• Enhanced Boolean functions suitable for the filter model of pseudo-random generator
• Boolean functions derived from Fermat quotients
• scientific article; zbMATH DE number 6907487 (Why is no real title available?)
• Distribution of the autocorrelation of random Boolean functions

This page was built for publication: Boolean functions derived from pseudorandom binary sequences

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