Skip to main content

Advertisement

Log in

Towards the optimality of Feistel ciphers with substitution-permutation functions

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We explore the optimality of balanced Feistel ciphers with SP-type F-functions with respect to their resistance against differential and linear cryptanalysis. Instantiations of Feistel ciphers with the wide class of (SP)\(^u\) and (SP)\(^u\)S F-functions are considered: one F-function can contain an arbitrary number of S-box layers interleaved with linear diffusion. For the matrices with maximum diffusion, it is proven that SPS and SPSP F-functions are optimal in terms of the proportion of active S-boxes in all S-boxes—a common efficiency metric for substitution-permutation ciphers. Interestingly, one SP-layer in the F-function is not enough to attain optimality whereas taking more than two S-box layers does not increase the efficiency either.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Aoki K., Ohta K.: Strict evaluation of the maximum average of differential probability and the maximum average of linear probability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E80–A(1), 2–8 (1997).

  2. Aoki K., Ichikawa T., Kanda M., Matsui M., Moriai S., Nakajima J., Tokita T.: Camellia: a 128-bit block cipher suitable for multiple platforms: design and analysis. In: Stinson D.R., Tavares S. (eds.) Proceedings of Selected Areas in Cryptography: SAC 2000. Lecture Notes in Computer Science, vol. 2012, pp. 39–56. Springer, Berlin (2001).

  3. Biham E.: On Matsui’s linear cryptanalysis. In: Santis A.D. (ed.) Advances in Cryptology: EUROCRYPT ’94. Lecture Notes in Computer Science, vol. 950. Springer, Berlin (1994).

  4. Biham E., Dunkelman O.: The SHAvite-3 hash function. Tweaked version (2009).

  5. Biham E., Shamir A.: Differential cryptanalysis of DES-like cryptosystems. J. Cryptol. 4, 3–72 (1991).

    Google Scholar 

  6. Bogdanov A.: On the differential and linear efficiency of balanced Feistel networks. Inf. Process. Lett. 110(20), 861–866 (2010).

    Google Scholar 

  7. Bogdanov A.: On unbalanced Feistel networks with contracting MDS diffusion. Des. Codes Cryptogr. 59(1—-3), 35–58 (2011).

    Google Scholar 

  8. Bogdanov A., Shibutani K.: Analysis of 3-line generalized Feistel networks with double SD-functions. Inf. Process. Lett. 111(13), 656–660 (2011).

    Google Scholar 

  9. Bogdanov A., Shibutani K.: Double SP-functions: enhanced generalized Feistel networks. In: Parampalli U., Hawkes P. (eds.) ACISP’11. Lecture Notes in Computer Science, vol. 6812, pp. 106–119. Springer, Berlin (2011).

  10. Bogdanov A., Shibutani K.: Generalized Feistel networks revisited. In: Canteaut A., Augot D. (eds.) Proceedings of International Workshop on Coding and Cryptography (WCC’11). Bergen, Norway (2011).

  11. Coppersmith D.: The data encryption standard (DES) and its strength against attacks. IBM J. Res. Dev. 38(3), 243–250 (1994).

    Google Scholar 

  12. Daemen J., Rijmen V.: The Design of Rijndael. The Advanced Encryption Standard (AES, Information Security and Cryptography). Springer, Berlin (2002).

  13. FIPS: Data Encryption Standard. National Bureau of Standards. US Department of Commerce, Washington (1997).

  14. Feistel H.: Cryptography and computer privacy. Sci. Am. 228, 1523 (1973).

    Google Scholar 

  15. Kanda M.: Practical security evaluation against differential and linear cryptanalyses for Feistel ciphers with SPN round function. In: Stinson D.R., Tavares S. (eds.) SAC 2000. Lecture Notes in Computer Science, vol. 2012. Springer, Berlin (2001).

  16. Kanda M., Moriai S., Aoki K., Ueda H., Takashima Y., Ohta K., Matsumoto T.: E2: a new 128-bit block cipher. IEICE Trans. Fundam. E83–A(1), 48–59 (2000).

  17. Kang J.S., Hong S., Lee S., Yi O., Park C., Lim J.: Practical and provable security against differential and linear cryptanalysis for substitution-permutation networks. ETRI J. 23(4), 158–167 (2001).

    Google Scholar 

  18. Matsui M.: Linear cryptanalysis of the Data Encryption Standard. In: Helleseth T. (ed.) Advances in Cryptology EUROCRYPT’93. Lecture Notes in Computer Science, pp. 386–397. Springer, Berlin (1994).

  19. Matsui M.: On correlation between the order of s-boxes and the strength of DES. In: Santis A.D. (ed.) Advances in Cryptology EUROCRYPT’94. Lecture Notes in Computer Science, vol. 950, pp. 366–375. Springer, Berlin (1994).

  20. National Soviet Bureau of Standards, Information Processing System: Cryptographic Protection—Cryptographic Algorithm GOST 28147–89 (1989).

  21. Shamir A.: On the Security of DES. CRYPTO’85. Lecture Notes in Computer Science. Springer, Berlin (1985).

  22. Schneier B., Kelsey J., Whiting D., Wagner D., Hall C., Ferguson N.: The Twofish Encryption Algorithm: A 128-Bit Block Cipher. Wiley, New York (1999).

  23. Shibutani K., Isobe T., Hiwatari H., Mitsuda A., Akishita T., Shirai T.: Piccolo: an ultra-lightweight blockcipher. In: Preneel B., Takagi T. (eds.) CHES’11. Lecture Notes in Computer Science, vol. 6917, pp. 342–357. Springer, Berlin (2011).

  24. Shimizu H.: On the security of Feistel cipher with SP-type F function. In Proceedings of SCIS (in Japanese) (2001).

  25. Shirai T., Preneel B.: On Feistel ciphers using optimal diffusion mappings across multiple rounds. In: Lee P.J. (ed.) ASIACRYPT’04. Lecture Notes in Computer Science, vol. 3329, pp. 1–15. Springer, Berlin (2004).

  26. Shirai T., Shibutani K.: Improving immunity of Feistel ciphers against differential cryptanalysis by using multiple MDS matrices. In: Roy B.K., Meier W. (eds.) FSE’04. Lecture Notes in Computer Science, vol. 3017, pp. 260–278. Springer, Berlin (2004).

  27. Shirai T., Shibutani K.: On Feistel structures using a diffusion switching mechanism. In: Robshaw M.J.B. (ed.) FSE’06. Lecture Notes in Computer Science, vol. 4047, pp. 41–56. Springer, Berlin (2006).

  28. Shirai T., Shibutani K., Akishita T., Moriai S., Iwata T.: The 128-bit blockcipher CLEFIA. In: Biryukov A. (ed.) FSE’07. Lecture Notes in Computer Science, vol. 4953, pp. 181–195. Springer, Berlin (2007).

  29. Tardy-Corfdir A., Gilbert H.: A known plaintext attack of FEAL-4 and FEAL-6. In: Feigenbaum J. (ed.) CRYPTO’91. Lecture Notes in Computer Science, vol. 576, pp. 172–181. Springer, Berlin (1991).

  30. Third Generation Partnership Project, Technical Specification Group Services and System Aspects, 3G Security, Specification of the 3GPP Confidentiality and Integrity Algorithms; Document 2: KASUMI Specification, V3.1.1 (2001).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kyoji Shibutani.

Additional information

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography”.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shibutani, K., Bogdanov, A. Towards the optimality of Feistel ciphers with substitution-permutation functions. Des. Codes Cryptogr. 73, 667–682 (2014). https://doi.org/10.1007/s10623-014-9970-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-014-9970-4

Keywords

Mathematics Subject Classification

Navigation