131 search results - page 2 / 27 » The complexity of Boolean functions from cryptographic viewp... |
ACISP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n Boolean variables wit...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
INDOCRYPT
2003
Springer
13 years 10 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...
ISLPED
1996
ACM
13 years 9 months ago
1996
ACM
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Current state-of-the-art image-based scene reconstruction
techniques are capable of generating high-fidelity 3D
models when used under controlled capture conditions.
However, th...