568 search results - page 2 / 114 » New bounds for the Cebysev functional |
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
SIAMJO
2002
13 years 4 months ago
2002
We introduce a new barrier function which is not a barrier function in the usual sense: it has finite value at the boundary of the feasible region. Despite this, its iteration bou...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
IPL
2000
13 years 4 months ago
2000
We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of t...