112 search results - page 17 / 23 » On the nonlinearity of monotone Boolean functions |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability mea...
DAC
2009
ACM
15 years 10 months ago
2009
ACM
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
Bent functions have maximal minimum distance to the set of affine functions. In other words, they achieve the maximal minimum distance to all the coordinate functions of affine mon...
100
click to vote
SACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
A vast amount of literature on stream ciphers is directed to the cryptanalysis of LFSR-based filters and combiners, resulting in various attack models such as distinguishing attac...