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, 2008, Volume 20, Issue 2, Pages 3–14
DOI: https://doi.org/10.4213/dm999 (Mi dm999) 		 
This article is cited in 2 scientific papers (total in 2 papers)

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

M. L. Buryakov
Full-text PDF (158 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm999
Abstract: We consider the relations between the level of affinity and other cryptographic parameters of Boolean functions such as nonlinearity, the order of correlation, and algebraic immunity. It is proved that the problem of finding the level of affinity for certain class of functions is an $NP$-hard problem.
Received: 11.12.2007
English version:
Discrete Mathematics and Applications, 2008, Volume 18, Issue 3, Pages 227–238
DOI: https://doi.org/10.1515/DMA.2008.018
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: M. L. Buryakov, “The relationship between the level of affinity and cryptographic parameters of Boolean functions”, Diskr. Mat., 20:2 (2008), 3–14; Discrete Math. Appl., 18:3 (2008), 227–238
Citation in format AMSBIB
\Bibitem{Bur08}
\by M.~L.~Buryakov
\paper The relationship between the level of affinity and cryptographic parameters of Boolean functions
\jour Diskr. Mat.
\yr 2008
\vol 20
\issue 2
\pages 3--14
\mathnet{http://mi.mathnet.ru/dm999}
\crossref{https://doi.org/10.4213/dm999}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2450029}
\zmath{https://zbmath.org/?q=an:1173.94417}
\elib{https://elibrary.ru/item.asp?id=20730239}
\transl
\jour Discrete Math. Appl.
\yr 2008
\vol 18
\issue 3
\pages 227--238
\crossref{https://doi.org/10.1515/DMA.2008.018}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-47249128653}
Linking options:
  • https://www.mathnet.ru/eng/dm999
  • https://doi.org/10.4213/dm999
  • https://www.mathnet.ru/eng/dm/v20/i2/p3
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:570
    Full-text PDF :246
    References:65
    First page:17
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024