Philippe Guillot

A Characterization of Binary Bent Functions

A recent paper by Carlet introduces a general class of binary bent functions on (GF(2))n(neven) whose elements are expressed by means of characteristic functions (indicators) of (n/2)-dimensional vector-subspaces of (GF(2))n. An extended version of this class is introduced in the same paper; it is conjectured that this version is equal to the whole class of bent functions. In the present paper, we prove that this conjecture is true.

A New Representation of Boolean Functions

We study a representation of Boolean functions (and more generally of integer-valued / complex-valued functions), not used until now in coding and cryptography, which yields more information than the currently known representations, on the combinatorial, spectral and cryptographic properties of the functions.

An Alternate Characterization of the Bentness of BinaryFunctions, with Uniqueness

AbstractIn a previous paper, we have obtained a characterization of the binary bent functions on (GF(2))n (n even) as linear combinations modulo

Completed GPS Covers All Bent Functions

2^{\frac{n}{2}}

On immunity profile of boolean functions

, with integral coefficients, of characteristic functions (indicators) of

Security proof of the canonical form of self-synchronizing stream ciphers

\frac{n}{2}