Sciweavers

9 search results - page 1 / 2
» On Boolean Functions Which Are Bent and Negabent
Sort
View
SSC
2007
Springer
192views Cryptology» more  SSC 2007»
14 years 1 months ago
On Boolean Functions Which Are Bent and Negabent
Bent functions f : Fm 2 → F2 achieve largest distance to all linear functions. Equivalently, their spectrum with respect to the Hadamard-Walsh transform is flat (i.e. all spectr...
Matthew G. Parker, Alexander Pott
DAM
2006
88views more  DAM 2006»
13 years 7 months ago
Finding nonnormal bent functions
The question if there exist nonnormal bent functions was an open question for several years. A Boolean function in n variables is called normal if there exists an affine subspace ...
Anne Canteaut, Magnus Daum, Hans Dobbertin, Gregor...
DCC
2008
IEEE
14 years 7 months ago
On Boolean functions with the sum of every two of them being bent
A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric...
Christian Bey, Gohar M. M. Kyureghyan
DM
2008
110views more  DM 2008»
13 years 7 months ago
A novel algorithm enumerating bent functions
By the relationship between the Walsh spectra at partial points and the Walsh spectra of its sub-functions, by the action of general linear group on the set of Boolean functions, ...
Qingshu Meng, Min Yang, Huanguo Zhang, Jingsong Cu...
FFA
2008
93views more  FFA 2008»
13 years 7 months ago
A new class of monomial bent functions
We study the Boolean functions f :F2n F2, n = 6r, of the form f (x) = Tr(xd) with d = 22r + 2r + 1 and F2n . Our main result is the characterization of those for which f are b...
Anne Canteaut, Pascale Charpin, Gohar M. M. Kyureg...