Abstract
The strict avalanche criterion was introduced by Webster and Tavares [3] in order to combine the ideas of completeness and the avalanche effect. A cryptographic transformation is complete if each output bit depends on all the input bits, and it exhibits the avalanche effect if an average of one half of the output bits change whenever a single input bit is complemented. To fulfil the strict avalanche criterion, each output bit should change with probability one half whenever a single input bit is complemented. This means, in particular, that there is no good lower order (fewer bits) approximation to the function. This is clearly a desirable cryptographic property since such an approximation would enable a corresponding reduction in the amount of work needed for an exhaustive search.
Chapter PDF
Similar content being viewed by others
References
R. Forré, The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition, Abstracts CRYPTO88.
J.B. Kam and G.I. Davida, A structured design of substitution-permutation encryption networks, IEEE Trans. on Computers, Vol. 28, No. 10 (1979).
A.F. Webster and S.E. Tavares, On the design of S-boxes, Advances in Cryptology, Proceedings CRYPTO85, Springer Verlag, Heidelberg, 1986
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lloyd, S. (1990). Counting Functions Satisfying a Higher Order Strict Avalanche Criterion. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_9
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive