Abstract
We describe a design procedure for the s-boxes of private key cryptosystems constructed as substitution-permutation networks (DES-like cryptosystems). Our procedure is proven to construct s-boxes which are bijective, are highly nonlinear, possess the strict avalanche criterion, and have output bits which act (vitually) independently when any single input bit is complemented. Furthermore, our procedure is very efficient: we have generated approximately 60 such 4 × 4 s-boxes in a few seconds of CPU time on a SUN workstation.
Article PDF
Similar content being viewed by others
References
C. M. Adams and S. E. Tavares, A Note on the Generation and Counting of Bent Sequences, Tech. Rep. TR 89-07, Department of Electrical Engineering, Queen's University, July 1989. Also in IEEE Transactions on Information Theory, 36 (1990), 1170–1173.
D. K. Branstad, J. Gait, and S. Katzke, Report of the Workshop on Cryptography in Support of Computer Security, Tech. Rep. NBSIR 77-1291, National Bureau of Standards, Sept. 1976.
E. F. Brickell, J. H. Moore, and M. R. Purtill, Structure in the s-boxes of the DES (extended abstract), in Advances in Cryptology: Proc. of CRYPTO '86, Springer-Verlag, New York, 1987, pp. 3–8.
J. M. Carroll and L. E. Robbins, Using binary derivatives to test an enhancement of DES, Cryptologia, 12 (1988), 193–208.
D. Chaum and J.-H. Evertse, Cryptanalysis of DES with a reduced number of rounds, in Advances in Cryptology: Proc. of CRYPTO '85, Springer-Verlag, New York, 1986, pp. 192–211.
B. den Boer, Cryptanalysis of F.E.A.L., in Advances in Cryptology: Proc of EUROCRYPT '88, Springer-Verlag, Berlin, 1989, pp. 167–173.
J.-H. Evertse, Linear structures in block ciphers, in Advances in Cryptology: Proc. of EUROCRYPT '87, Springer-Verlag, Berlin, 1988, pp. 249–266.
H. Feistel, Cryptography and computer privacy, Scientific American, 228 (1973), 15–23.
H. Feistel, W. Notz, and J. L. Smith, Some cryptographic techniques for machine-to-machine data communications, Proceedings of the IEEE, 63 (1975), 1545–1554.
R. Forré, The strict avalanche criterion: spectral properties of boolean functions and an extended definition, in Advances in Cryptology: Proc. of CRYPTO '88, Springer-Verlag, New York, 1989, pp. 450–468.
W. Fumy, On the F-function of FEAL, in Advances in Cryptology: Proc. of CRYPTO '87, Springer-Verlag, New York, 1988, pp. 434–437.
M. E. Hellman, R. Merkle, R. Schroeppel, L. Washington, W. Diffie, S. Pohlig, and P. Schweitzer, Results of an Initial Attempt to Cryptanalyze the NBS Data Encryption Standard, Tech. Rep. SEL 76-042, Information Systems Laboratory, Stanford University, Nov. 1976.
J. B. Kam and G. I. Davida, Structured design of substitution-permutation encryption networks, IEEE Transactions on Computers, 28 (1979), 747–753.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, in Advances in Cryptology: Proc. of EUROCRYPT '89, to appear.
National Bureau of Standards (U.S.), Data Encryption Standard (DES), Federal Information Processing Standards Publication 46, 1977.
J. P. Pieprzyk, Nonlinear functions and their application to cryptography, Archiwum Automatyki i Telemechaniki, 3–4 (1985), 311–323.
J. Pieprzyk and G. Finkelstein, Towards effective nonlinear cryptosystem design, IEE Proceedings, Part E: Computers and Digital Techniques, 135 (1988), 325–335.
O. S. Rothaus, On “Bent” functions, Journal of Combinatorial Theory, 20(A) (1976), 300–305.
R. A. Rueppel, Analysis and Design of Stream Ciphers, Springer-Verlag, Heidelberg, 1986.
R. Scott, Wide-open encryption design offers flexible implementations, Cryptologia, 9 (1985), 75–90.
A. Shamir, On the security of DES, in Advances in Cryptology: Proc. of CRYPTO '85, Springer-Verlag, New York, 1986, pp. 280–281.
C. E. Shannon, Communication theory of secrecy systems, Bell Systems Technical Journal, 28 (1949), 656–715.
A. F. Webster, Plaintext/Ciphertext Bit Dependencies in Cryptographic Systems, Master's thesis, Department of Electrical Engineering, Queen's University, 1985.
A. F. Webster and S. E. Tavares, On the design of s-boxes, in Advances in Cryptology: Proc. of CRYPTO '85, Springer-Verlag, New York, 1986, pp. 523–534.
K. C. Zeng, J. H. Yang, and Z. T. Dai, Patterns of entropy drop of the key in an s-box of the DES, in Advances in Cryptology: Proc. of CRYPTO '87, Springer-Verlag, New York, 1988, pp. 438–444.
Author information
Authors and Affiliations
Additional information
This work was partially supported by a grant from the Natural Sciences and Engineering Research Council of Canada.
Rights and permissions
About this article
Cite this article
Adams, C., Tavares, S. The structured design of cryptographically good s-boxes. J. Cryptology 3, 27–41 (1990). https://doi.org/10.1007/BF00203967
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00203967