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



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






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


Diskretnaya Matematika, 2016, Volume 28, Issue 2, Pages 117–126
DOI: https://doi.org/10.4213/dm1374
(Mi dm1374)
 

On $1$-stable perfectly balanced Boolean functions

S. V. Smyshlyaev

ООО „КРИПТО-ПРО“
References:
Abstract: The paper is concerned with relations between the correlation-immunity (stability) and the perfectly balancedness of Boolean functions. It is shown that an arbitrary perfectly balanced Boolean function fails to satisfy a certain property that is weaker than the $1$-stability. This result refutes some assertions by Markus Dichtl. On the other hand, we present new results on barriers of perfectly balanced Boolean functions which show that any perfectly balanced function such that the sum of the lengths of barriers is smaller than the length of variables, is $1$-stable.
Keywords: perfectly balanced functions, barriers of Boolean functions, correlation-immunity, cryptography.
Funding agency Grant number
Russian Foundation for Basic Research 16-01-00226 А
16-01-00470 А
This work was supported by the Russian Fund for Basic Research, grant nos. 16-01-00226-a and 16-01-00470-a).
Received: 19.04.2016
English version:
Discrete Mathematics and Applications, 2017, Volume 27, Issue 2, Pages 109–115
DOI: https://doi.org/10.1515/dma-2017-0013
Bibliographic databases:
Document Type: Article
UDC: 519.716.322+519.719.2
Language: Russian
Citation: S. V. Smyshlyaev, “On $1$-stable perfectly balanced Boolean functions”, Diskr. Mat., 28:2 (2016), 117–126; Discrete Math. Appl., 27:2 (2017), 109–115
Citation in format AMSBIB
\Bibitem{Smy16}
\by S.~V.~Smyshlyaev
\paper On $1$-stable perfectly balanced Boolean functions
\jour Diskr. Mat.
\yr 2016
\vol 28
\issue 2
\pages 117--126
\mathnet{http://mi.mathnet.ru/dm1374}
\crossref{https://doi.org/10.4213/dm1374}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3559797}
\elib{https://elibrary.ru/item.asp?id=26414208}
\transl
\jour Discrete Math. Appl.
\yr 2017
\vol 27
\issue 2
\pages 109--115
\crossref{https://doi.org/10.1515/dma-2017-0013}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000403472300006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85018368101}
Linking options:
  • https://www.mathnet.ru/eng/dm1374
  • https://doi.org/10.4213/dm1374
  • https://www.mathnet.ru/eng/dm/v28/i2/p117
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024