11 search results - page 1 / 3 » Construction of 1-Resilient Boolean Functions with Optimal A... |
JCST
2011
12 years 11 months ago
2011
FSE
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We investigate the link between the nonlinearity of a Boolean function and its propagation characteristics. We prove that highly nonlinear functions usually have good propagation p...
ACISP
2003
Springer
13 years 10 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...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...