Loading [MathJax]/jax/output/SVG/config.js
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], 2017, Volume 8, Issue 2, Pages 87–96
DOI: https://doi.org/10.4213/mvk226 (Mi mvk226) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference

S. A. Lozhkin, M. S. Shupletsov, B. R. Danilov

Lomonosov Moscow State University, Moscow
Full-text PDF (164 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk226
Abstract: We propose several asymptotically size-optimal Boolean circuits synthesis methods that implement arbitrary Boolean functions of a given number of Boolean variables with a given protection level from functionality inference when concealing some number of local interconnections. These methods rely on the structure of Boolean circuits over arbitrary finite complete basis. Constructed by methods of generalized decomposition and universal systems of Boolean functions.
Key words: Boolean circuits, asymptotic methods, obscuration of functionality.
Funding agency Grant number
Академия криптографии РФ
The study was supported by the Academy of Cryptography of the Russian Federation.
Received 11.VI.2016
Bibliographic databases:
Document Type: Article
UDC: 519.719.2
Language: English
Citation: S. A. Lozhkin, M. S. Shupletsov, B. R. Danilov, “Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference”, Mat. Vopr. Kriptogr., 8:2 (2017), 87–96
Citation in format AMSBIB
\Bibitem{LozShuDan17}
\by S.~A.~Lozhkin, M.~S.~Shupletsov, B.~R.~Danilov
\paper Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference
\jour Mat. Vopr. Kriptogr.
\yr 2017
\vol 8
\issue 2
\pages 87--96
\mathnet{http://mi.mathnet.ru/mvk226}
\crossref{https://doi.org/10.4213/mvk226}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3689435}
\elib{https://elibrary.ru/item.asp?id=29864951}
Linking options:
  • https://www.mathnet.ru/eng/mvk226
  • https://doi.org/10.4213/mvk226
  • https://www.mathnet.ru/eng/mvk/v8/i2/p87
    • This publication is cited in the following 1 articles:
    1. Sergey Andreevich Lozhkin, Anastasia Fedorovna Pavlova, Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar “Discrete Mathematics and Its Applications”, 2022, 82  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:312
    Full-text PDF :218
    References:48
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025