7,660 research outputs found
Design and analysis of bent functions using -subspaces
In this article, we provide the first systematic analysis of bent functions
on in the Maiorana-McFarland class
regarding the origin and cardinality of their -subspaces, i.e.,
vector subspaces on which the second-order derivatives of vanish. By
imposing restrictions on permutations of , we specify
the conditions, such that Maiorana-McFarland bent functions admit a unique -subspace of dimension . On the
other hand, we show that permutations with linear structures give rise to
Maiorana-McFarland bent functions that do not have this property. In this way,
we contribute to the classification of Maiorana-McFarland bent functions, since
the number of -subspaces is invariant under equivalence.
Additionally, we give several generic methods of specifying permutations
so that admits a unique -subspace. Most
notably, using the knowledge about -subspaces, we show that using
the bent 4-concatenation of four suitably chosen Maiorana-McFarland bent
functions, one can in a generic manner generate bent functions on
outside the completed Maiorana-McFarland class
for any even . Remarkably, with our construction
methods it is possible to obtain inequivalent bent functions on
not stemming from two primary classes, the partial spread
class and . In this way, we contribute to a better
understanding of the origin of bent functions in eight variables, since only a
small fraction, of which size is about , stems from and
, whereas the total number of bent functions on
is approximately
Minimal -ary codes from non-covering permutations
In this article, we propose several generic methods for constructing minimal linear codes over the field . The first construction uses the method of direct sum of an arbitrary function and a bent function to induce minimal codes with parameters and minimum distance larger than . For the first time, we provide a general construction of linear codes from a subclass of non-weakly regular plateaued functions, which partially answers an open problem posed in [22]. The second construction deals with a bent function and a subspace of suitable derivatives of , i.e., functions of the form for some . We also provide a sound generalization of the recently introduced concept of non-covering permutations [45]. Some important structural properties of this class of permutations are derived in this context. The most remarkable observation is that the class of non-covering permutations contains the class of APN power permutations (characterized by having two-to-one derivatives). Finally, the last general construction combines the previous two methods (direct sum, non-covering permutations and subspaces of derivatives) together with a bent function in the Maiorana-McFarland class to construct minimal codes (even those violating the Ashikhmin-Barg bound) with a larger dimension. This last method proves to be quite flexible since it can lead to several non-equivalent codes, depending to a great extent on the choice of the underlying non-covering permutation
Doubly Perfect Nonlinear Boolean Permutations
Due to implementation constraints the XOR operation is widely used in order
to combine plaintext and key bit-strings in secret-key block ciphers. This
choice directly induces the classical version of the differential attack by the
use of XOR-kind differences. While very natural, there are many alternatives to
the XOR. Each of them inducing a new form for its corresponding differential
attack (using the appropriate notion of difference) and therefore block-ciphers
need to use S-boxes that are resistant against these nonstandard differential
cryptanalysis. In this contribution we study the functions that offer the best
resistance against a differential attack based on a finite field
multiplication. We also show that in some particular cases, there are robust
permutations which offers the best resistant against both multiplication and
exponentiation base differential attacks. We call them doubly perfect nonlinear
permutations
- …