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], 2019, Volume 10, Issue 3, Pages 81–87
DOI: https://doi.org/10.4213/mvk301 (Mi mvk301) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Functional circuits defining families of permutations of the space $GF(2)^N$

F. M. Malyshev

Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
Full-text PDF (325 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk301
Abstract: We consider families of mappings of Boolean vector spaces which are defined by functional circuits consisting of linear and nonlinear functional elements. Conditions on the structure of connections between circuit elements and on the linear functional elements which guarantee the bijectivity of mappings for any choice of nonlinear functional elements are given.
Key words: functional circuits, regular shift registers, Feistel schemes, linear medium, bijective mappings.
Received 29.IV.2019
Bibliographic databases:
Document Type: Article
UDC: 519.719.2+519.716.39
Language: Russian
Citation: F. M. Malyshev, “Functional circuits defining families of permutations of the space $GF(2)^N$”, Mat. Vopr. Kriptogr., 10:3 (2019), 81–87
Citation in format AMSBIB
\Bibitem{Mal19}
\by F.~M.~Malyshev
\paper Functional circuits defining families of permutations of~the~space~$GF(2)^N$
\jour Mat. Vopr. Kriptogr.
\yr 2019
\vol 10
\issue 3
\pages 81--87
\mathnet{http://mi.mathnet.ru/mvk301}
\crossref{https://doi.org/10.4213/mvk301}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1472486}
Linking options:
  • https://www.mathnet.ru/eng/mvk301
  • https://doi.org/10.4213/mvk301
  • https://www.mathnet.ru/eng/mvk/v10/i3/p81
    • 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:351
    Full-text PDF :181
    References:37
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024