Bounds on the number of functions satisfying the Strict Avalanche Criterion

Information Processing Letters

Volumn 60, Issue 4, 1996, Pages 215-219

  Cusick, Thomas W ^a   Stǎnicǎ, Pantelimon ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

Boolean functions; Combinatorial problems; Cryptography; Enumeration; Strict Avalanche Criterion

Indexed keywords

BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; MATHEMATICAL TECHNIQUES; VECTORS;

ENUMERATION; STRICT AVALANCHE CRITERION;

CRYPTOGRAPHY;

EID: 0030288222     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00164-0     Document Type: Article

References (4)

1. T.W. Cusick, Bounds on the number of functions satisfying the Strict Avalanche Criterion, Inform. Process. Lett. 57 (1996) 261-263.
2. L. O'Connor, An upper bound on the number of functions satisfying the Strict Avalanche Criterion, Inform. Process. Lett. 52 (1994) 325-327.
3. A.F. Webster and S.E. Tavares, On the design of S-boxes, in: H.C. Williams, ed., Advances in Cryptology - Crypto '85, Lectures Notes in Computer Science 218 (Springer, Berlin, 1986) 523-534.
4. A.M. Youssef and S.E. Tavares, Comment on "Bounds on the number of functions satisfying the Strict Avalanche Criterion", Inform. Process. Lett. 60 (5) (1996).