CRYPTO
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. This paper investigates the design of S-boxes used for combining linear feedback shift register (LFSR) sequences in combination generators. Such combination generators ha...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
We establish, for the first time, an explicit and simple lower bound on the nonlinearity Nf of a Boolean function f of n variables satisfying the avalanche criterion of degree p, ...
ACISP
2000
Springer
13 years 9 months ago
2000
Springer
This paper shows how suitable choice of cost function can significantly affect the power of optimisation methods for the synthesising of Boolean functions. In particular we show ...
RANDOM
2001
Springer
13 years 9 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
ISMVL
2002
IEEE
13 years 9 months ago
2002
IEEE
A generalization of McMillan’s conjunctive expansion of Boolean functions [1] to the case of multiple-valued input binary-valued output functions is presented. It is based on th...
INDOCRYPT
2003
Springer
13 years 9 months ago
2003
Springer
We develop an improved cost function to be used in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonli...
CRYPTO
2003
Springer
13 years 9 months ago
2003
Springer
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
COCO
2003
Springer
13 years 9 months ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
ACISP
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n Boolean variables wit...