We study the nonlinearity of functions defined on a finite field with 2^m elements which are the trace of a polynomial of degree 7 or more general polynomials of binary degree equal to 3. We show that for m odd such functions have rather good nonlinearity properties. We use for that recent results of Maisner and Nart about zeta functions of supersingular curves of genus 2. We give some criterion for a vectorial function not to be almost perfect nonlinear
AbstractBent functions are those Boolean functions whose Hamming distance to the Reed–Muller code of...
We obtain tight bound between nonlinearity and algebraic immunity of a Boolean function and construc...
AbstractA practical problem in symmetric cryptography is finding constructions of Boolean functions ...
We investigate the nonlinearity of functions from F_2^{m} to F_2^{n}. We give asymptotic bounds for ...
International audienceIt is known that the symmetric Boolean functions with optimal nonlinearity are...
We study the nonlinearity of functions defined on a finite field with 2^m elements which are the tra...
AbstractFunctions with high nonlinearity have important applications in cryptography, sequences and ...
Cryptographic Boolean functions must be complex to satisfy Shannon\u27s principle of confusion. But ...
Cryptographic Boolean functions must be complex to satisfy Shannon\u27s principle of confusion. But ...
AbstractNonlinear characteristics of (Boolean) functions is one of the important issues both in the ...
. Highly nonlinear Boolean functions occupy an important position in the design of secure block as w...
http://eprint.iacr.org/2011/373http://eprint.iacr.org/2011/373Lisoněk recently reformulated the char...
AbstractNonlinear characteristics of (Boolean) functions is one of the important issues both in the ...
We study the natural analogue of the Mertens conjecture in the setting of global function fields. Bu...
In this paper we consider cubic bent functions obtained by Leander and McGuire (J. Comb. Th. Series ...
AbstractBent functions are those Boolean functions whose Hamming distance to the Reed–Muller code of...
We obtain tight bound between nonlinearity and algebraic immunity of a Boolean function and construc...
AbstractA practical problem in symmetric cryptography is finding constructions of Boolean functions ...
We investigate the nonlinearity of functions from F_2^{m} to F_2^{n}. We give asymptotic bounds for ...
International audienceIt is known that the symmetric Boolean functions with optimal nonlinearity are...
We study the nonlinearity of functions defined on a finite field with 2^m elements which are the tra...
AbstractFunctions with high nonlinearity have important applications in cryptography, sequences and ...
Cryptographic Boolean functions must be complex to satisfy Shannon\u27s principle of confusion. But ...
Cryptographic Boolean functions must be complex to satisfy Shannon\u27s principle of confusion. But ...
AbstractNonlinear characteristics of (Boolean) functions is one of the important issues both in the ...
. Highly nonlinear Boolean functions occupy an important position in the design of secure block as w...
http://eprint.iacr.org/2011/373http://eprint.iacr.org/2011/373Lisoněk recently reformulated the char...
AbstractNonlinear characteristics of (Boolean) functions is one of the important issues both in the ...
We study the natural analogue of the Mertens conjecture in the setting of global function fields. Bu...
In this paper we consider cubic bent functions obtained by Leander and McGuire (J. Comb. Th. Series ...
AbstractBent functions are those Boolean functions whose Hamming distance to the Reed–Muller code of...
We obtain tight bound between nonlinearity and algebraic immunity of a Boolean function and construc...
AbstractA practical problem in symmetric cryptography is finding constructions of Boolean functions ...