131 search results - page 1 / 27 » The complexity of Boolean functions from cryptographic viewp... |
DAGSTUHL
2006
13 years 6 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
EIT
2008
IEEE
13 years 11 months ago
2008
IEEE
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 ...
DLOG
2009
13 years 2 months ago
2009
Abstract. Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences....
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
The proliferation of all kinds of devices with different security requirements and constraints, and the arms-race nature of the security problem are increasingly demanding the de...