706 search results - page 14 / 142 » On a quasi-ordering on Boolean functions |
IFIP
2004
Springer
14 years 1 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...
FSTTCS
2001
Springer
14 years 4 days ago
2001
Springer
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...
DAGSTUHL
2006
13 years 9 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...
TCS
2002
13 years 7 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...