An upper bound for the number of functions satisfying the strict avalanche criterion.

Autor: Pankov, K. N.
Předmět:
Zdroj: Discrete Mathematics & Applications; 2005, Vol. 15 Issue 3, p263-269, 7p
Abstrakt: The strict avalanche criterion was introduced by Webster and Tavares while studying some cryptographic functions. We say that a binary function f(x), x ∈ Vn, 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. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index