Normality of Vectorial Functions
نویسندگان
چکیده
The most important building blocks of symmetric cryptographic primitives such as the DES or the AES, are vectorial Boolean functions, also called S-boxes. In this paper, we extend the definition of normality for Boolean functions into several new affine invariant properties for vectorial Boolean functions. We compute the probability of occurrence of these properties and present practical algorithms for each of these new properties. We find a new structural property for the AES S-box, which also holds for a large class of permutation functions when the dimension n is even. Moreover, we prove a relation with the propagation characteristics of a vectorial function and extend the scope of non-APN functions for n even.
منابع مشابه
On the Primary Constructions of Vectorial Boolean Bent Functions∗
Vectorial Boolean bent functions, which possess the maximal nonlinearity and the minimum differential uniformity, contribute to optimum resistance against linear cryptanalysis and differential cryptanalysis for the cryptographic algorithms that adopt them as nonlinear components. This paper is devoted to the new primary constructions of vectorial Boolean bent functions, including four types: ve...
متن کاملFurther Characterization of H Vectorial Functions
Vectorial Boolean bent functions, which possess the maximal nonlinearity and the minimum differential uniformity, contribute to optimum resistance against linear cryptanalysis and differential cryptanalysis. H vectorial functions is an infinite class of vectorial Boolean bent functions presented by S. Mesnager. This paper is devoted to further characterization of the H vectorial functions. It i...
متن کاملOn the Existence and Constructions of Vectorial Boolean Bent Functions
Recently, one of the hot topics on vectorial Boolean bent functions is to construct vectorial Boolean bent functions in the form Tr m(P (x)) from Boolean bent functions in the form Tr 1 (P (x)), where P (x) ∈ F2n [x]. This paper first presents three constructions of vectorial Boolean bent functions in the form Tr m(P (x)), where two of them give answers to two open problems proposed by Pasalic ...
متن کاملCharacterizations for Vectorial Prequasi–invex Type Functions via Jensen Type Inequalities
The purpose of this paper is to derive some criteria for vectorial prequasi-invex type functions via Jensen type inequalities. It is shown that a Jensen type inequality is sufficient and necessary for a vector function to be prequasi-invex under the condition of lower levelclosedness, cone lower semicontinuity, cone upper semicontinuity and semistrict prequasi-invexity, respectively. Analogous ...
متن کاملVectorial Boolean functions and linear codes in the context of algebraic attacks
In this paper we study the relationship between vectorial (Boolean) functions and cyclic codes in the context of algebraic attacks. We first derive a direct link between the annihilators of a vectorial function (in univariate form) and certain 2n-ary cyclic codes (which we prove that they are LCD codes) extending results due to Rønjom and Helleseth. The knowledge of the minimum distance of thos...
متن کامل