[PDF] Top 20 A note on generalized bent criteria for Boolean functions
Has 10000 "A note on generalized bent criteria for Boolean functions" found on our website. Below are the top 20 most common "A note on generalized bent criteria for Boolean functions".
A note on generalized bent criteria for Boolean functions
... of Boolean functions with respect to the action of uni- tary transforms obtained by taking tensor products of the Hadamard kernel, denoted by H , and the nega– Hadamard kernel, denoted by ... See full document
6
Bent and Semi-bent Functions via Linear Translators
... for Boolean functions (see for instance [10]). Functions with linear structures are considered as weak for some cryptographic ...hash functions proposed in [1] exploits a similar weakness of ... See full document
18
A note on hyper-bent functions via Dillon-like exponents
... To this end, we first explain how the original restriction for Charpin–Gong criterion can be weakened before generalizing the Mesnager approach to arbitrary Dillon-like exponents. Afterward, we tackle the problem of ... See full document
31
Some results on $q$-ary bent functions
... such generalized Maiorana- McFarland (GMMF) type bent ...4) bent functions on n + 1 variables in terms of their subfunctions on ...of Boolean functions are defined in the ... See full document
11
Constructing Vectorial Boolean Functions with High Algebraic Immunity Based on Group Decomposition
... a generalized description for constructing vectorial Boolean functions with high algebraic ...vectorial Boolean functions with high(sometimes optimal) algebraic immunity, one is ... See full document
12
Correlation immunity and resiliency of boolean functions from Haar domain perspective
... cryptographic Boolean functions employed in the ...employed Boolean functions meet specific security ...such criteria are the correlation immunity and resiliency of a given ... See full document
7
A Method For Generation Of High-Nonlinear S-Boxes Based On Gradient Descent
... vectorial Boolean functions for selection of substitutions (S-boxes) for symmetric cryptographic primitives are ...vectorial Boolean functions generation with optimal crypto- graphic ... See full document
9
A note on generalized convex functions
... Note that the η-convexity reduces to the usual convexity if η(x, y) = x –y in Definition 1.3. The main purpose of the article is to give a non-trivial example for a η-convex func- tion defined on rectangle is not ... See full document
10
Blocks of Monotone Boolean Functions
... In summary we will note the following. The method of the analysis and MBFs classification on the basis of creation of MBFs blocks is developed. Application of this method to MBFs analysis with number of variables ... See full document
7
Matrix characterization of symmetry groups of boolean functions
... of M can assume 0 or 1 too. That kind of device can be represented by boolean function f which n variables (we can consider generalized modules M which have outputs from the set {0, 1, ..., k − 1}). In ... See full document
13
A NOTE ON BAYESIAN ANALYSIS OF DECAPITATED GENERALIZED POISSON DISTRIBUTION UNDER VARIOUS LOSS FUNCTIONS
... From a theoretical decision perspective, in order to select the 'best' estimator, a loss function must be specified and the loss function is used to represent a penalty associated with each of the possible estimates. ... See full document
12
Boolean functions for homomorphic-friendly stream ciphers
... homomorphic-friendly functions for this generation are the ones with a low multiplicative depth (and a bounded number of ...homomorphic-friendly functions, beyond the restrictions of very small ... See full document
14
Constructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice
... hyper-bent functions in terms of the number of rational points on certain hyperelliptic ...hyper-bent functions with time complexity and space complexity O(r ... See full document
12
Secondary constructions on generalized bent functions
... construct generalized bent Boolean func- tions in n + 2 variables from 4 generalized Boolean functions in n vari- ...two generalized bent Boolean ... See full document
9
A note on constructions of bent functions from involutions
... This note is organized as follows. Formal definitions and necessary preliminaries are introduced in Section 2. In Section 3, we recall previous methods used in [26] and [27] on the constructions of binary ... See full document
14
On the Primary Constructions of Vectorial Boolean Bent Functions
... monomial bent functions are given, which imply answers to one open problem proposed by ...monomial bent function T r 1 n (ax d ), we present several conditions which are much closer to the sufficient ... See full document
43
New results on nonexistence of generalized bent functions
... a bent function (for q = 2) was presented by Rothaus [15] in 1976, and generalized by Kumar et ...of functions with maximum nonlinearity, bent functions draw much at- tention and are ... See full document
13
On weak and strong 2^k-bent Boolean functions
... As in [11], we next prove a theorem that gives the 2 k -Hadamard trans- form of various combinations of Boolean functions. For easy writing, when k is fixed, we shall use H f instead of H f (2 k ) . We will ... See full document
20
Constructing Infinite Families of Low Differential Uniformity $(n,m)$-Functions with $m>n/2$
... the functions do not need mandatorily to be ...Other criteria also exist, like the transparency order, which are still less ...of functions more difficult and may result in less good ... See full document
22
More PS and H-like bent functions
... all bent functions (or more practically, classifying them under the action of the general affine group) being out of reach, several constructions of bent functions have been investigated, ... See full document
12
Related subjects