{"title":"S-Blocks of Special Type with Few Variables","authors":"D. A. Zyubina, N. N. Tokareva","doi":"10.1134/S1990478923020229","DOIUrl":null,"url":null,"abstract":"<p> When constructing block ciphers, it is necessary to use vector Boolean functions with\nspecial cryptographic properties as S-blocks for the cipher’s resistance to various types of\ncryptanalysis. In this paper, we investigate the following S-block construction: let\n<span>\\( \\pi \\)</span> be a permutation on\n<span>\\( n \\)</span> elements, let\n<span>\\( \\pi ^i \\)</span> be the\n<span>\\( i \\)</span>-fold application of the permutation\n<span>\\( \\pi \\)</span>, and let\n<span>\\( f \\)</span> be a Boolean function of\n<span>\\( n \\)</span> variables. Define a vector Boolean function\n<span>\\( F_{\\pi }\\colon \\mathbb {Z}_2^n \\to \\mathbb {Z}_2^n \\)</span> as\n<span>\\( F_{\\pi }(x) = (f(x), f(\\pi (x)), \\ldots , f(\\pi _{n-1}(x))) \\)</span>. We study the cryptographic properties of\n<span>\\( F_{\\pi } \\)</span> such as high nonlinearity, balancedness, and low differential\n<span>\\( \\delta \\)</span>-uniformity in the dependence on the properties of\n<span>\\( f \\)</span> and\n<span>\\( \\pi \\)</span> for small\n<span>\\( n \\)</span>. Complete sets of Boolean functions\n<span>\\( f \\)</span> and vector Boolean functions\n<span>\\( F_{\\pi } \\)</span> of few variables with maximum algebraic immunity are also obtained.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 2","pages":"451 - 457"},"PeriodicalIF":0.5800,"publicationDate":"2023-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S1990478923020229","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0
Abstract
When constructing block ciphers, it is necessary to use vector Boolean functions with
special cryptographic properties as S-blocks for the cipher’s resistance to various types of
cryptanalysis. In this paper, we investigate the following S-block construction: let
\( \pi \) be a permutation on
\( n \) elements, let
\( \pi ^i \) be the
\( i \)-fold application of the permutation
\( \pi \), and let
\( f \) be a Boolean function of
\( n \) variables. Define a vector Boolean function
\( F_{\pi }\colon \mathbb {Z}_2^n \to \mathbb {Z}_2^n \) as
\( F_{\pi }(x) = (f(x), f(\pi (x)), \ldots , f(\pi _{n-1}(x))) \). We study the cryptographic properties of
\( F_{\pi } \) such as high nonlinearity, balancedness, and low differential
\( \delta \)-uniformity in the dependence on the properties of
\( f \) and
\( \pi \) for small
\( n \). Complete sets of Boolean functions
\( f \) and vector Boolean functions
\( F_{\pi } \) of few variables with maximum algebraic immunity are also obtained.
期刊介绍:
Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.