Computational nanotechnology
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Comp. nanotechnol.:
Year:
Volume:
Issue:
Page:
Find




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

Computational nanotechnology, 2018, Issue 3, Pages 32–43 (Mi cn197)  
05.13.00 INFORMATICS, COMPUTER FACILITIES AND MANAGEMENT
05.13.19 INFORMATION SECURITY

Geometric approach to estimation of complexity boolean functions

V. G. Nikonov, A. I. Zobova

a “FSRBIT”
Full-text PDF (793 kB)
Abstract: This paper describes fundamentally new method to estimate difficulty of boolean functions and analyzes possibilities of its using for building functions with required parameters. The interest to this method nowadays is caused by engineering new principles of implementation of data security.
Keywords: geometric complexity, boolean function.
Document Type: Article
Language: Russian
Citation: V. G. Nikonov, A. I. Zobov, “Geometric approach to estimation of complexity boolean functions”, Comp. nanotechnol., 2018, no. 3, 32–43
Citation in format AMSBIB
\Bibitem{NikZob18}
\by V.~G.~Nikonov, A.~I.~Zobov
\paper Geometric approach to estimation of complexity boolean functions
\jour Comp. nanotechnol.
\yr 2018
\issue 3
\pages 32--43
\mathnet{http://mi.mathnet.ru/cn197}
Linking options:
  • https://www.mathnet.ru/eng/cn197
  • https://www.mathnet.ru/eng/cn/y2018/i3/p32
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Computational nanotechnology
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024