|
This article is cited in 1 scientific paper (total in 1 paper)
An upper bound for the number of functions satisfying the strict avalanche criterion
K. N. Pankov
Abstract:
The strict avalanche criterion was introduced by Webster and Tavares
while studying some cryptographic functions.
We say that a binary function $f(x)$, $x \in V_n$, satisfies this criterion
if replacing any coordinate of the vector $x$ by its complement
changes the values of $f(x)$ exactly in a half of cases.
In this paper we establish an upper bound for the number of such functions for
$n$ large enough.
Received: 05.10.2004
Citation:
K. N. Pankov, “An upper bound for the number of functions satisfying the strict avalanche criterion”, Diskr. Mat., 17:2 (2005), 95–101; Discrete Math. Appl., 15:3 (2005), 263–269
Linking options:
https://www.mathnet.ru/eng/dm101https://doi.org/10.4213/dm101 https://www.mathnet.ru/eng/dm/v17/i2/p95
|
Statistics & downloads: |
Abstract page: | 497 | Full-text PDF : | 238 | References: | 43 | First page: | 2 |
|