92 search results - page 7 / 19 » Nonlinearity Bounds and Constructions of Resilient Boolean F... |
FOCS
1991
IEEE
13 years 10 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
INDOCRYPT
2003
Springer
13 years 12 months ago
2003
Springer
We develop an improved cost function to be used in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonli...
COCO
1997
Springer
13 years 11 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
APPML
2006
13 years 6 months ago
2006
We obtain an upper bound on a new type of exponential sums with linear recurrence sequences. We apply this bound to estimate the Fourier coefficients, and thus the nonlinearity, o...
EUROCRYPT
1990
Springer
13 years 10 months ago
1990
Springer
The relation between the Walsh-Hadamard transform and the autocorrelation function of Boolean functions is used to study propagation characteristics of these functions. The Strict...