RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2019 Volume 10, Issue 3, Pages 81–87 (Mi mvk301)

This article is cited 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

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.

UDC: 519.719.2+519.716.39

Received 29.IV.2019

DOI: 10.4213/mvk301



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024