76 search results - page 3 / 16 » On Boolean Functions with Generalized Cryptographic Properti... |
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
ICALP
2001
Springer
13 years 10 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...
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
CAI
2007
Springer
13 years 5 months ago
2007
Springer
Abstract. The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphe...
TCAD
1998
13 years 5 months ago
1998
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...