Skip to main content
SpringerLink
Log in

Construction of DES-like S-boxes based on Boolean functions satisfying the SAC

  • Conference paper
  • First Online:
Advances in Cryptology — ASIACRYPT '91 (ASIACRYPT 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 739))

Included in the following conference series:

Abstract

In this paper, we present how to construct DES-like S-boxes based on Boolean functions satisfying the Strict Avalanche Criterion and compare their cryptographic properties with those of DES S-boxes in various points of view. We found that our designed DES-like S-boxes exhibit better cryptographical properties than those of DES S-boxes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Feistel, “Cryptography and Computer Privacy”, Scientific American, Vol.228, No.5, pp 15–23, 1973.

    PubMed  Google Scholar 

  2. O.S. Rothaus, “On “Bent” Functions”, J. of Combinatorial Theory(A), Vol.20, pp.300–305, 1976.

    Article  Google Scholar 

  3. “Data Encryption Standard”, National Bureau of Standards, Federal Information Processing Standard, Vol. 46, U.S.A., Jan., 1977.

    Google Scholar 

  4. J.B. Kam and G.I. Davida, “Structured Design of Substitution Permutation Networks”, IEEE Trans. on Comp., Vol. C-28, No.10, pp.747–753, Oct., 1979.

    Google Scholar 

  5. A.F. Webster, “Plaintext/Ciphertext Dependences in Cryptographic Systems”, Master's Thesis, Queen's Univ., CANADA, 1985.

    Google Scholar 

  6. A.F. Webster and S.E. Tavares, “On the Design of S-boxes”, Proc. of CRYPTO'85, Springer-Verlag, 1985.

    Google Scholar 

  7. E.F. Brickell, J.H. Moore, and M.R. Purtill, “Structures in the S-boxes of the DES”, Proc. of CRYPTO'86, Springer-Verlag, pp.3–8, 1986.

    Google Scholar 

  8. R.A. Rueppel, Analysis and Design of Stream Ciphers, Springer-Verlag, Berlin, 1986.

    Google Scholar 

  9. S. Miyaguchi, A. Shiraishi, and A. Shimizu, “Fast Data Encryption Algorithm FEAL-8”, (in Japanese), Electr. Comm. Lab. Tech. J., NTT, Vol.37, No.4/5, pp.321–327, 1988.

    Google Scholar 

  10. R. Forré, “The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition”, Proc.of CRYPTO'88, Springer-Verlag, 1988.

    Google Scholar 

  11. J. Pieprzyk, “Nonlinearity of Exponent Permutations”, Proc. of EUROCRYPT'89, Springer-Verlag, 1989.

    Google Scholar 

  12. J. Pieprzyk and G. Finkelstein, “Towards Effective Nonlinear Cryptosystem Design”, IEE, Pt.E, Vol.135, pp.325–335, 1988.

    Google Scholar 

  13. W. Meier and O. Staffelbach, “Nonlinearity Criteria for Cryptographic Functions”, Proc. of EUROCRYPT'89, Springer-Verlag, 1989.

    Google Scholar 

  14. K. Takaraki, K. Sasaki, and F. Nakagawa, “Multi-Media Encryption Algorithm (in Japanese)”, 89-MDP-40-5, 1989.1.19.

    Google Scholar 

  15. C. Adams and S. Tavares, “The Use of Bent Sequences to Achieve Higher-Order Strict Avalanche Criterion in S-box Design”, (Private Communication), 1990.

    Google Scholar 

  16. L. Brown, J. Pieprzyk, and J. Seberry, “LOKI — a Cryptographic Primitive for Authentication and Secrecy”, Proc. of AUSCRYPT'90, 1990.

    Google Scholar 

  17. E. Biham and A. Shamir, “Differential Cryptanalysis of DES-like Cryptosystems”, Proc. of CRYPTO'90, 1990.

    Google Scholar 

  18. K. Kim, T. Matsumoto, and H. Imai, “On Generating Cryptographically Desirable Substitutions”, Trans. IEICE, Vol. E73, No.7, Jul., 1990.

    Google Scholar 

  19. K. Kim, T. Matsumoto, and H. Imai, “A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion”, Proc. of CRYPTO'90, 1990.

    Google Scholar 

  20. K. Kim, T. Matsumoto, and H. Imai, “Methods to Generate Functions Satisfying the Strict Avalanche Criterion”, Technical Report on Information Security, ISEC90-30, Nov. 13, 1990.

    Google Scholar 

  21. K. Kim, T. Matsumoto, and H. Imai, “On the Cryptographic Significance of Bent Functions”, KSEAJ Letters, 1990.

    Google Scholar 

  22. R. Forré, “Methods and Instruments for Designing S-boxes”, J. of Cryptology, Vol.2, No.3, pp.115–130, 1990.

    Google Scholar 

  23. K. Kim, “A Study on the Construction and Analysis of Substitution Boxes for Symmetric Cryptosystems”, Ph.D Thesis, Yokohama National Univ., 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Daedog Danji Electronics and Telecommunications Research Institute, Section 710, P.O.Box 8, 305-606, Daejeon, Chungnam, Korea

    Kwangjo Kim

Authors
  1. Kwangjo Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hideki Imai Ronald L. Rivest Tsutomu Matsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, K. (1993). Construction of DES-like S-boxes based on Boolean functions satisfying the SAC. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-57332-1_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57332-6

  • Online ISBN: 978-3-540-48066-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation