论文信息 - Comment on "Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion"

Comment on "Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion"

The Strict Avalanche Criterion (SAC) was introduced by Webster and Tavares (1995) in a study of design criteria for certain cryptographic functions. O'Connor (1994) gave an upper bound for the number of functions satisfying the SAC. Cusick (1996) gave a lower bound for the number of functions satisfying the SAC. He also gave a conjecture that provided an improvement of the lower bound. We give a constructive proof for this conjecture. Moreover, we provide an improved lower bound.

Amr M. Youssef | Stafford E. Tavares | S. Tavares | A. Youssef

[1] Thomas W. Cusick,et al. Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion , 1996, Inf. Process. Lett..

[2] Willi Meier,et al. Nonlinearity Criteria for Cryptographic Functions , 1990, EUROCRYPT.

[3] Luke O'Connor,et al. An Upper Bound on the Number of Functions Satisfying the Strict Avalanche Criterion , 1994, Information Processing Letters.

[4] Stafford E. Tavares,et al. On the Design of S-Boxes , 1985, CRYPTO.