Abtract
The ideas of completeness and the avalanche effect were first introduced by Kam and Davida [1] and Feistel [2], respectively. If a cryptographic transformation is complete, then each ciphertext bit must depend on all of the plaintext bits. Thus, if it were possible to find the simplest Boolean expression for each ciphertext bit in terms of the plaintext bits, each of those expressions would have to contain all of the plaintext bits if the function was complete. Alternatively, if there is at least one pair of n-bit plaintext vectors X and Xi that differ only in bit i, and f(X) and f(Xi) differ at least in bit j for all
then the function f must be complete.
Chapter PDF
Keywords
- Data Encryption Standard
- Avalanche Effect
- Strict Avalanche Criterion
- Cryptographic Transformation
- Avalanche Vector
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Kam, J.B., and Davida, G.I.: Structured Design of Substitution-Permutation Encryption Networks. IEEE Transactions on Computers, Vol. 28, No. 10, 747 (1979)
Feistel, H.: Cryptography and Computer Privacy. Scientific American, Vol. 228, No. 5, 15 (1973)
Konheim, A.G.: Cryptography: a Primer. John Wiley and Sons, New York (1981)
Webster, A.F.: Plaintext/Ciphertext Bit Dependencies in Cryptographic Algorithms. M.Sc. thesis, Queen’s University at Kingston (1985)
National Bureau of Standards: Data Encryption Standard. FIPS Publication 46, Washington, D.C. (1977)
Hellman, M.E., Merkle, R., Schroeppel, R., Washington, L., Diffie, W., Pohlig, S., and Schweitzer, P.: Results of an Initial Attempt to Cryptanalyze the NBS Data Encryption Standard. SEL 76-042, Stanford University (1976)
Meyer, C.H.: Ciphertext/Plaintext and Ciphertext/Key Dependence vs Number of Rounds for the Data Encryption Standard. 1978 National Computer Conference, p. 1119. AFIPS Press, Montvale, New Jersey (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Webster, A.F., Tavares, S.E. (1986). On the Design of S-Boxes. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_41
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive