76 search results - page 4 / 16 » On Boolean Functions with Generalized Cryptographic Properti... |
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always w...
COCO
2007
Springer
14 years 2 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
EUROCRYPT
1990
Springer
13 years 12 months ago
1990
Springer
The relation between the Walsh-Hadamard transform and the autocorrelation function of Boolean functions is used to study propagation characteristics of these functions. The Strict...
CRYPTO
1990
Springer
13 years 12 months ago
1990
Springer
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
INDOCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...