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

DOI10.4213/MVK301MaRDI QIDQ3383087zbMATH OpenOpenAlexFDO

Authors F. M. Malyshev

Publication date 23 September 2021

Published in Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mvk301

zbMATH Keywords

bijective mappingsFeistel schemesfunctional circuitslinear mediumregular shift registers

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Analytic circuit theory (94C05)

Recommendations

• Построение подстановок пространства $V_{2m}$ с использованием $(2m,m)$-функций
• scientific article; zbMATH DE number 1930413
• The minimal circuits for linear Boolean functions
• scientific article; zbMATH DE number 426131
• Recursively-generated permutations of a binary space

Cites work

• Двойственность разностного и линейного методов в криптографии

Cited in

(4)

• Affine equivalency and nonlinearity preserving bijective mappings over \(\mathbb {F}_2\)
• scientific article; zbMATH DE number 796497 (Why is no real title available?)
• Вероятностные соотношения для преобразований конечных векторных пространств
• Methods of linear and differential relations in cryptography

This page was built for publication: Functional circuits defining families of permutations of the space \(\mathrm{GF}(2)^n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3383087)