Sciweavers

TCS
2002
13 years 10 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf
JSW
2007
126views more  JSW 2007»
13 years 10 months ago
Efficient Evaluation of Multiple-Output Boolean Functions in Embedded Software or Firmware
— The paper addresses software and firmware implementation of multiple-output Boolean functions based on cascades of Look-Up Tables (LUTs). A LUT cascade is described as a means ...
Vaclav Dvorak
TIT
2008
78views more  TIT 2008»
13 years 10 months ago
Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications
The nonlinearity profile of a Boolean function (i.e. the sequence of its minimum Hamming distances nlr(f) to all functions of degrees at most r, for r 1) is a cryptographic crite...
Claude Carlet
TCS
2008
13 years 10 months ago
On a quasi-ordering on Boolean functions
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
Miguel Couceiro, Maurice Pouzet
MST
2006
120views more  MST 2006»
13 years 10 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
JCT
2006
87views more  JCT 2006»
13 years 10 months ago
Construction of bent functions via Niho power functions
A 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 ...
Hans Dobbertin, Gregor Leander, Anne Canteaut, Cla...
IANDC
2006
93views more  IANDC 2006»
13 years 10 months ago
Aperiodic propagation criteria for Boolean functions
We characterise the aperiodic autocorrelation for a Boolean function, f, and define the Aperiodic Propagation Criteria (APC) of degree l and order q. We establish the strong simil...
Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G...
DM
2006
72views more  DM 2006»
13 years 10 months ago
Patterson-Wiedemann construction revisited
In 1983, Patterson and Wiedemann constructed Boolean functions on n = 15 input variables having nonlinearity strictly greater than 2n-1 -2 n-1 2 . Construction of Boolean function...
Sugata Gangopadhyay, Pradipkumar H. Keskar, Subham...
FFA
2008
93views more  FFA 2008»
13 years 10 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...
ECCC
2010
99views more  ECCC 2010»
13 years 10 months ago
A Unified Framework for Testing Linear-Invariant Properties
Abstract--There has been a sequence of recent papers devoted to understanding the relation between the testability of properties of Boolean functions and the invariance of the prop...
Arnab Bhattacharyya, Elena Grigorescu, Asaf Shapir...