Asymptotic bounds for the affinity level for almost all Boolean functions

DOI10.1515/DMA.2008.039MaRDI QIDQ3184566zbMATH OpenFDO

Authors M. L. Buryakov

Publication date 21 October 2009

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/DMA.2008.039

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60)

Recommendations

• A lower bound for the affinity level for almost all Boolean functions
• On values of affinity level for almost all Boolean functions
• On the affinity level of Boolean functions
• Estimating the level of affinity of a quadratic form
• Asymptotic nonlinearity of Boolean functions

Cites work

• On the affinity level of Boolean functions
• The relationship between the level of affinity and cryptographic parameters of Boolean functions

Cited in

(10)

• Estimating the level of affinity of a quadratic form
• Bounds for the number of Boolean functions admitting affine approximations of a given accuracy
• The relationship between the level of affinity and cryptographic parameters of Boolean functions
• A lower bound for the affinity level for almost all Boolean functions
• On values of affinity level for almost all Boolean functions
• Lower and upper bounds for the affinity order of transformations of Boolean vector spaces
• On the degree of restrictions of \(q\)-valued logic functions to linear manifolds
• A threshold property of quadratic Boolean functions
• On the affinity level of Boolean functions
• On the strong affinity level of Boolean functions

This page was built for publication: Asymptotic bounds for the affinity level for almost all Boolean functions

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