On the strong affinity level of Boolean functions

MaRDI QIDQ7318072zbMATH OpenFDO

Authors A. V. Kulagin, Alexey V. Tarasov

Publication date 24 August 2026

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Mathematics Subject Classification ID

Computer science (68-XX) Quantum theory (81-XX)

Cites work

• A crossbred algorithm for solving Boolean polynomial systems
• A lower bound for the affinity level for almost all Boolean functions
• Asymptotic bounds for the affinity level for almost all Boolean functions
• Boolean functions in coding theory and cryptology. With a foreword by V. A. Sadovnichij
• Estimating the level of affinity of a quadratic form
• Local affinity of Boolean mappings
• On the affinity level of Boolean functions
• On the degree of restrictions of \(q\)-valued logic functions to linear manifolds
• On the relationship between local affinities of a Boolean function and some types of its degeneracy
• On values of affinity level for almost all Boolean functions
• The relationship between the level of affinity and cryptographic parameters of Boolean functions

This page was built for publication: On the strong affinity level of Boolean functions

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