Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2010, Volume 1, Issue 3, Pages 45–65
DOI: https://doi.org/10.4213/mvk15 (Mi mvk15) 		 
This article is cited in 4 scientific papers (total in 4 papers)

On the conplexity of joint realization of Boolean functions regular systems in the DNF basis

V. G. Nikonova, A. V. Sarantsevb

a Academy of Criptography of Russia, Moscow
b LLC "Certification Research Center", Moscow
Full-text PDF (194 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk15
Abstract: Some complexity estimates of joint realization of Boolean functions regular systems in the DNF basis are derived. It is shown that the complexity of joint realization of such systems in the orthogonal DNF basis is equal to its maximal value. A description of functions whiah may be used to generate regular systems of Boolean functions by means of transforms from the Jevons group is given.
Key words: complexity of realisation, DNF, permutation, regular system of Boolean functions.
Received 22.IV.2010
Document Type: Article
UDC: 510.52, 512.622
Language: Russian
Citation: V. G. Nikonov, A. V. Sarantsev, “On the conplexity of joint realization of Boolean functions regular systems in the DNF basis”, Mat. Vopr. Kriptogr., 1:3 (2010), 45–65
Citation in format AMSBIB
\Bibitem{NikSar10}
\by V.~G.~Nikonov, A.~V.~Sarantsev
\paper On the conplexity of joint realization of Boolean functions regular systems in the DNF basis
\jour Mat. Vopr. Kriptogr.
\yr 2010
\vol 1
\issue 3
\pages 45--65
\mathnet{http://mi.mathnet.ru/mvk15}
\crossref{https://doi.org/10.4213/mvk15}
Linking options:
  • https://www.mathnet.ru/eng/mvk15
  • https://doi.org/10.4213/mvk15
  • https://www.mathnet.ru/eng/mvk/v1/i3/p45
    • 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:473
    Full-text PDF :294
    References:49
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024