23 search results - page 3 / 5 » New Constructions of Resilient Boolean Functions with Maxima... |
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper addresses the problem of obtaining new construction methods for cryptographically significant Boolean functions. We show that for each positive integer m, ther...
EUROCRYPT
2001
Springer
13 years 12 months ago
2001
Springer
Bent functions have maximal minimum distance to the set of affine functions. In other words, they achieve the maximal minimum distance to all the coordinate functions of affine mon...
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...
CRYPTO
2001
Springer
13 years 12 months ago
2001
Springer
An (n, m, k)-resilient function is a function f : Fn 2 → Fm 2 such that every possible output m-tuple is equally likely to occur when the values of k arbitrary inputs are fixed ...
INDOCRYPT
2004
Springer
14 years 26 days ago
2004
Springer
By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a bett...