AbstractA Boolean function with an even number n=2k of variables is called bent if it is maximally nonlinear. We present here a new construction of bent functions. Boolean functions of the form f(x)=tr(α1xd1+α2xd2), α1,α2,x∈F2n, are considered, where the exponents di (i=1,2) are of Niho type, i.e. the restriction of xdi on F2k is linear. We prove for several pairs of (d1,d2) that f is a bent function, when α1 and α2 fulfill certain conditions. To derive these results we develop a new method to prove that certain rational mappings on F2n are bijective
AbstractIn this paper, we present three results on bent functions: a construction, a restriction, an...
This paper considers the bent and hyper-bent properties of a class of Boolean functions. For one cas...
This paper considers the bent and hyper-bent properties of a class of Boolean functions. For one cas...
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...
International audienceWe study the Boolean functions fλ :F2n →F2, n = 6r, of the form f (x) = Tr(λxd...
Bent functions are maximally nonlinear Boolean functions. They are important functions introduced by...
Abstract—We introduce the notion of k-bent function, i.e., a Boolean function with even numberm of v...
Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of di...
Given a bent function f (x) of n variables, its max-weight and min-weight functions are introduced a...
The maximum length sequences, also called m-sequences, have re-ceived a lot of attention since the l...
AbstractFor any Boolean function f on GF(2)m, we define a sequence of ranks ri(f), 1 ⩽ i ⩽ m, which ...
Bent functions are maximally nonlinear Boolean functions. They are important functions introduced by...
AbstractOne of the classes of bent Boolean functions introduced by John Dillon in his thesis is fami...
AbstractIn this paper, we present three results on bent functions: a construction, a restriction, an...
AbstractIn this paper, we present three results on bent functions: a construction, a restriction, an...
This paper considers the bent and hyper-bent properties of a class of Boolean functions. For one cas...
This paper considers the bent and hyper-bent properties of a class of Boolean functions. For one cas...
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...
International audienceWe study the Boolean functions fλ :F2n →F2, n = 6r, of the form f (x) = Tr(λxd...
Bent functions are maximally nonlinear Boolean functions. They are important functions introduced by...
Abstract—We introduce the notion of k-bent function, i.e., a Boolean function with even numberm of v...
Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of di...
Given a bent function f (x) of n variables, its max-weight and min-weight functions are introduced a...
The maximum length sequences, also called m-sequences, have re-ceived a lot of attention since the l...
AbstractFor any Boolean function f on GF(2)m, we define a sequence of ranks ri(f), 1 ⩽ i ⩽ m, which ...
Bent functions are maximally nonlinear Boolean functions. They are important functions introduced by...
AbstractOne of the classes of bent Boolean functions introduced by John Dillon in his thesis is fami...
AbstractIn this paper, we present three results on bent functions: a construction, a restriction, an...
AbstractIn this paper, we present three results on bent functions: a construction, a restriction, an...
This paper considers the bent and hyper-bent properties of a class of Boolean functions. For one cas...
This paper considers the bent and hyper-bent properties of a class of Boolean functions. For one cas...