Comment on "bounds on the number of functions satisfying the Strict Avalanche Criterion"

Information Processing Letters

Volumn 60, Issue 5, 1996, Pages 271-275

  Youssef, A M ^a   Tavares, S E ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

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

Indexed keywords

BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; GRAPH THEORY; PROBLEM SOLVING; VECTORS;

COMBINATORIAL PROBLEMS; HAMMING WEIGHT; STRICT AVALANCHE CRITERION;

CRYPTOGRAPHY;

EID: 0030577335     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00166-4     Document Type: Note

References (8)

1. D.K. Biss, A lower bound on the number of functions satisfying the Strict Avalanche Criterion, Submitted.
2. T.W. Cusick, Bounds on the number of functions satisfying the Strict Avalanche Criterion, Inform. Process. Lett. 57 (1996) 261-263.
3. T.W. Cusick and P. Stǎnicǎ, Bounds on the number of functions satisfying the Strict Avalanche Criterion, Inform. Process. Lett. 60 (1996) 215-219.
4. J.H. Evertse, Linear structures in block ciphers, in: Advances in Cryptology: Proc. of EUROCRYPT'87 (Springer, Berlin, 1988) 249-266.
5. W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, in: Advances in Cryptology: Proc. of EUROCRYPT'89 (Springer, Berlin, 1990) 549-562.
6. L.J. O'Connor, An upper bound on the number of functions satisfying the Strict Avalanche Criterion, Inform. Process. Lett. 52 (1994) 325-327.
7. L.J. O'Connor and A. Klapper, Algebraic nonlinearity and its application to cryptography, J. Cryptology 7 (1994) 213-227.
8. A.F. Webster and S.E. Tavares, On the design of S-boxes, in: Advances in Cryptology: Proc. of CRYPTO'85 (Springer, Berlin, 1986) 523-534.