Sciweavers

707 search results - page 72 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
ICCAD
2007
IEEE
115views Hardware» more  ICCAD 2007»
14 years 5 months ago
Timing optimization by restructuring long combinatorial paths
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
Jürgen Werber, Dieter Rautenbach, Christian S...
ASIACRYPT
2005
Springer
14 years 1 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
14 years 1 months ago
DPA Attacks and S-Boxes
For the power consumption model called Hamming weight model, we rewrite DPA attacks in terms of correlation coefficients between two Boolean functions. We exhibit properties of S-b...
Emmanuel Prouff
ISMIS
2005
Springer
14 years 1 months ago
Normal Forms for Knowledge Compilation
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
Reiner Hähnle, Neil V. Murray, Erik Rosenthal
COGSR
2011
102views more  COGSR 2011»
13 years 3 months ago
Rethinking cognitive architecture via graphical models
Cognitive architectures need to resolve the diversity dilemma – i.e., to blend diversity and simplicity – in order to couple functionality and efficiency with integrability, e...
Paul S. Rosenbloom