Bent functions are maximally nonlinear Boolean functions. They are important functions introduced by Rothaus and studied rstly by Dillon and next by many researchers for four decades. Since the complete classication of bent functions seems elusive, many researchers turn to design constructions of bent functions. In this note, we show that linear involutions (which are an important class of permutations) over nite elds give rise to bent functions in bivariate representations. In particular, we exhibit new constructions of bent functions involving binomial linear involutions whose dual functions are directly obtained without computation
AbstractOne of the classes of bent Boolean functions introduced by John Dillon in his thesis is fami...
AbstractOne of the classes of bent Boolean functions introduced by John Dillon in his thesis is fami...
AbstractThis paper discusses homogeneous bent functions. The space of homogeneous functions of degre...
Bent functions are maximally nonlinear Boolean functions. They are important functions introduced by...
Boolean functions are vital components of symmetric-key ciphers such as block ciphers, stream cipher...
Starting from the secondary construction originally introduced by Carlet ["On Bent and Highly Nonlin...
Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of di...
We show how to construct semi-bent Boolean functions from PSap- like bent functions. We derive innit...
Given a bent function f (x) of n variables, its max-weight and min-weight functions are introduced a...
AbstractA Boolean function with an even number n=2k of variables is called bent if it is maximally n...
The paper is dealing with two important subclasses of plateaued functions: bent and semi-bent functi...
(Vectorial) Boolean functions play an important role in all domains related to computer science, and...
AbstractIn this paper, we present three results on bent functions: a construction, a restriction, an...
(Vectorial) Boolean functions play an important role in all domains related to computer science, and...
AbstractA Boolean function with an even number n=2k of variables is called bent if it is maximally n...
AbstractOne of the classes of bent Boolean functions introduced by John Dillon in his thesis is fami...
AbstractOne of the classes of bent Boolean functions introduced by John Dillon in his thesis is fami...
AbstractThis paper discusses homogeneous bent functions. The space of homogeneous functions of degre...
Bent functions are maximally nonlinear Boolean functions. They are important functions introduced by...
Boolean functions are vital components of symmetric-key ciphers such as block ciphers, stream cipher...
Starting from the secondary construction originally introduced by Carlet ["On Bent and Highly Nonlin...
Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of di...
We show how to construct semi-bent Boolean functions from PSap- like bent functions. We derive innit...
Given a bent function f (x) of n variables, its max-weight and min-weight functions are introduced a...
AbstractA Boolean function with an even number n=2k of variables is called bent if it is maximally n...
The paper is dealing with two important subclasses of plateaued functions: bent and semi-bent functi...
(Vectorial) Boolean functions play an important role in all domains related to computer science, and...
AbstractIn this paper, we present three results on bent functions: a construction, a restriction, an...
(Vectorial) Boolean functions play an important role in all domains related to computer science, and...
AbstractA Boolean function with an even number n=2k of variables is called bent if it is maximally n...
AbstractOne of the classes of bent Boolean functions introduced by John Dillon in his thesis is fami...
AbstractOne of the classes of bent Boolean functions introduced by John Dillon in his thesis is fami...
AbstractThis paper discusses homogeneous bent functions. The space of homogeneous functions of degre...