RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2010 Number 3(9), Pages 17–21 (Mi pdm241)

This article is cited in 4 papers

Theoretical Foundations of Applied Discrete Mathematics

On values of affinity level for almost all Boolean functions

O. A. Logachev

Institute for Information Security Issues, Lomonosov Moscow State University, Moscow, Russia

Abstract: In the current paper, we consider asymptotic form of values of one parameter of Boolean functions, namely affinity level (generalized affinity level). We prove that asymptotically (with $n\to\infty$) values of affinity level (generalized affinity level) for almost all Boolean functions are all in the segment $[n-\log_2n,n-\log_2n+1]$.

Keywords: affinity level, generalized affinity level, Boolean equations, cryptography.

UDC: 519.7



© Steklov Math. Inst. of RAS, 2025