Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika, 2010, Number 3(9), Pages 17–21 (Mi pdm241)  

This article is cited in 4 scientific papers (total 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
Full-text PDF (528 kB) Citations (4)
References:
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.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: O. A. Logachev, “On values of affinity level for almost all Boolean functions”, Prikl. Diskr. Mat., 2010, no. 3(9), 17–21
Citation in format AMSBIB
\Bibitem{Log10}
\by O.~A.~Logachev
\paper On values of affinity level for almost all Boolean functions
\jour Prikl. Diskr. Mat.
\yr 2010
\issue 3(9)
\pages 17--21
\mathnet{http://mi.mathnet.ru/pdm241}
Linking options:
  • https://www.mathnet.ru/eng/pdm241
  • https://www.mathnet.ru/eng/pdm/y2010/i3/p17
  • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:358
    Full-text PDF :116
    References:66
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024