92 search results - page 10 / 19 » Nonlinearity Bounds and Constructions of Resilient Boolean F... |
CRYPTO
2000
Springer
13 years 10 months ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
EUROCRYPT
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
EUROCRYPT
2009
Springer
14 years 7 months ago
2009
Springer
A weak pseudorandom function (wPRF) is a cryptographic primitive similar to ? but weaker than ? a pseudorandom function: for wPRFs one only requires that the output is pseudorandom...
APAL
2004
13 years 6 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
EUROCRYPT
2001
Springer
13 years 11 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...