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

DOI10.1515/DMA.2008.018MaRDI QIDQ3184536zbMATH 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.018

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60)

Recommendations

• On the affinity level of Boolean functions
• On values of affinity level for almost all Boolean functions
• scientific article; zbMATH DE number 1866861
• Asymptotic bounds for the affinity level for almost all Boolean functions
• A lower bound for the affinity level for almost all Boolean functions

Cites work

• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• On ``bent functions
• On the affinity level of Boolean functions

Cited in

(8)

• Asymptotic bounds for the affinity level for almost all Boolean functions
• Local affinity of Boolean mappings
• On values of affinity level for almost all Boolean functions
• scientific article; zbMATH DE number 7310259 (Why is no real title available?)
• A lower bound for the distance between a bijunctive function and a function with the fixed algebraic immunity
• On the affinity level of Boolean functions
• On the relationship between local affinities of a Boolean function and some types of its degeneracy
• On the strong affinity level of Boolean functions

This page was built for publication: The relationship between the level of affinity and cryptographic parameters of Boolean functions

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