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 s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1996-12, Vol.60 (5), p.271-275
Hauptverfasser: Youssef, A.M., Tavares, S.E.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Boolean functions
Combinatorial problems
Computer science
control theory
systems
Cryptography
Enumeration
Exact sciences and technology
Functions
Information processing
Information, signal and communications theory
Logical, boolean and switching functions
Mathematical models
Signal and communications theory
Strict Avalanche Criterion
Studies
Telecommunications and information theory
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(96)00166-4