Sciweavers

706 search results - page 10 / 142
» On a quasi-ordering on Boolean functions
Sort
View
EIT
2008
IEEE
14 years 2 months ago
Relating Boolean gate truth tables to one-way functions
We present a schema to build one way functions from a family of Boolean gates. Moreover, we relate characteristics of these Boolean gate truth tables to properties of the derived ...
Mahadevan Gomathisankaran, Akhilesh Tyagi
ECBS
2007
IEEE
122views Hardware» more  ECBS 2007»
14 years 2 months ago
Time- and Space-Efficient Evaluation of Sparse Boolean Functions in Embedded Software
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
Vaclav Dvorak
INDOCRYPT
2004
Springer
14 years 1 months ago
On Boolean Functions with Generalized Cryptographic Properties
By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a bett...
An Braeken, Ventzislav Nikov, Svetla Nikova, Bart ...
JSW
2007
126views more  JSW 2007»
13 years 7 months ago
Efficient Evaluation of Multiple-Output Boolean Functions in Embedded Software or Firmware
— The paper addresses software and firmware implementation of multiple-output Boolean functions based on cascades of Look-Up Tables (LUTs). A LUT cascade is described as a means ...
Vaclav Dvorak
CAV
2011
Springer
234views Hardware» more  CAV 2011»
12 years 11 months ago
Resolution Proofs and Skolem Functions in QBF Evaluation and Applications
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
Valeriy Balabanov, Jie-Hong R. Jiang