Skip to main content
SpringerLink
Log in

On Permutation Layer of Type 1, Source-Heavy, and Target-Heavy Generalized Feistel Structures

  • Conference paper
Cryptology and Network Security (CANS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7092))

Included in the following conference series:

Abstract

The Generalized Feistel Structure (GFS) generally uses the sub-block-wise cyclic shift in the permutation layer, the layer between the two F function layers. For Type 2 GFS, at FSE 2010, Suzaki and Minematsu showed that a better diffusion property can be obtained if one uses some other sub-block-wise permutation. In this paper, we consider Type 1, Source-Heavy (SH), and Target-Heavy (TH) GFSs, and study if their diffusion properties can be improved by changing the sub-block-wise cyclic shift. For Type 1 GFS, we show that it achieves better diffusion for many cases, while this is not the case for SH and TH GFSs, i.e., the diffusion property of SH and TH GFSs does not change even if we change the sub-block-wise cyclic shift. We also experimentally derive optimum permutations in terms of diffusion, and evaluate the security of the resulting schemes against saturation, impossible differential, differential, and linear attacks.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, C., Gilchrist, J.: The CAST-256 Encryption Algorithm. Network Working Group RFC 2612 (June 1999), http://www.ietf.org/rfc/rfc2612.txt

  2. Anderson, R.J., Biham, E.: Two Practical and Provably Secure Block Ciphers: BEAR and LION. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 113–120. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  3. Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., Tokita, T.: The 128-Bit Block Cipher Camellia. IEICE Trans. Fundamentals E85-A(1), 11–24 (2002)

    MATH  Google Scholar 

  4. Biham, E., Biryukov, A., Shamir, A.: Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 12–23. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Biham, E., Shamir, A.: Differential Cryptanalysis of DES-like Cryptosystems. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 2–21. Springer, Heidelberg (1991)

    Google Scholar 

  6. Bogdanov, A.: On Unbalanced Feistel Networks with Contracting MDS Diffusion. Des. Codes Cryptography 59(1-3), 35–58 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bogdanov, A., Shibutani, K.: Analysis of 3-Line Generalized Feistel Networks with Double SD-functions. Inf. Process. Lett. 111(13), 656–660 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bogdanov, A., Shibutani, K.: Double SP-Functions: Enhanced Generalized Feistel Networks. In: Parampalli, U., Hawkes, P. (eds.) ACISP 2011. LNCS, vol. 6812, pp. 106–119. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Bogdanov, A., Shibutani, K.: Generalized Feistel Networks Revisited. In: WCC 2011 (2011)

    Google Scholar 

  10. Chabaud, F., Vaudenay, S.: Links Between Differential and Linear Cryptanalysis. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 356–365. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  11. Choy, J., Yap, H.: Impossible Boomerang Attack for Block Cipher Structures. In: Takagi, T., Mambo, M. (eds.) IWSEC 2009. LNCS, vol. 5824, pp. 22–37. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Daemen, J., Knudsen, L.R., Rijmen, V.: The Block Cipher SQUARE. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 149–165. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  13. Daemen, J., Rijmen, V.: The Design of Rijndael: AES - The Advanced Encryption Standard. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  14. FIPS: Data Encryption Standard. National Institute of Standards and Technology (1999)

    Google Scholar 

  15. FIPS: Secure Hash Standard. National Institute of Standards and Technology (2002)

    Google Scholar 

  16. Hirose, S., Kuwakado, H., Yoshida, H.: SHA-3 Proposal: Lesamnta (2008), http://www.hitachi.com/rd/yrl/crypto/lesamnta/index.html

  17. Hoang, V.T., Rogaway, P.: On Generalized Feistel Networks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 613–630. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  18. Hong, D., Sung, J., Hong, S.H., Lim, J.-I., Lee, S.-J., Koo, B.-S., Lee, C.-H., Chang, D., Lee, J., Jeong, K., Kim, H., Kim, J.-S., Chee, S.: HIGHT: A New Block Cipher Suitable for Low-Resource Device. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 46–59. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. IBM Corporation: MARS–A Candidate Cipher for AES (September 1999), http://domino.research.ibm.com/comm/research_projects.nsf/pages/security.mars.html

  20. Jutla, C.S.: Generalized Birthday Attacks on Unbalanced Feistel Networks. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 186–199. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  21. Kim, J., Hong, S., Sung, J., Lee, C., Lee, S.: Impossible Differential Cryptanalysis for Block Cipher Structures. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 82–96. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  22. Kim, J., Lee, C., Sung, J., Hong, S., Lee, S., Lim, J.: Seven New Block Cipher Structures with Provable Security against Differential Cryptanalysis. IEICE Trans. Fundamentals E91-A(10), 3047–3058 (2008)

    Article  Google Scholar 

  23. Lucks, S.: Faster Luby-Rackoff Ciphers. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 189–203. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  24. Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386–397. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  25. Matsui, M.: On Correlation between the Order of S-Boxes and the Strength of DES. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 366–375. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  26. Minematsu, K., Suzaki, T., Shigeri, M.: On Maximum Differential Probability of Generalized Feistel. In: Parampalli, U., Hawkes, P. (eds.) ACISP 2011. LNCS, vol. 6812, pp. 89–105. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  27. Moriai, S., Vaudenay, S.: On the Pseudorandomness of Top-Level Schemes of Block Ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 289–302. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  28. Naor, M., Reingold, O.: On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. J. Cryptology 12(1), 29–66 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  29. Nyberg, K.: Generalized Feistel Networks. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 91–104. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  30. Patarin, J., Nachef, V., Berbain, C.: Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 396–411. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  31. Patarin, J., Nachef, V., Berbain, C.: Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 325–341. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  32. Rivest, R.L.: A Description of the RC2(r) Encryption Algorithm. Network Working Group RFC 2268 (March 1998), http://www.ietf.org/rfc/rfc2268.txt

  33. Rivest, R.L., Robshaw, M.J.B., Sidney, R., Yin, Y.L.: The RC6 block cipher. Specification 1.1 (August 1998), http://people.csail.mit.edu/rivest/Rc6.pdf

  34. Schneier, B., Kelsey, J.: Unbalanced Feistel Networks and Block Cipher Design. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 121–144. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  35. Shibutani, K.: On the Diffusion of Generalized Feistel Structures Regarding Differential and Linear Cryptanalysis. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 211–228. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  36. Shirai, T., Araki, K.: On Generalized Feistel Structures Using a Diffusion Switching Mechanism. IEICE Trans. Fundamentals E91-A(8), 2120–2129 (2008)

    Article  Google Scholar 

  37. Shirai, T., Shibutani, K., Akishita, T., Moriai, S., Iwata, T.: The 128-Bit Blockcipher CLEFIA (Extended Abstract). In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 181–195. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  38. Sony Corporation: The 128-bit Blockcipher CLEFIA, Security and Performance Evaluations (2007) revision 1.0, http://www.sony.net/Products/cryptography/clefia/

  39. Suzaki, T., Minematsu, K.: Improving the Generalized Feistel. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol. 6147, pp. 19–39. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  40. Wu, W., Zhang, W., Lin, D.: Security on Generalized Feistel Scheme with SP Round Function. I. J. Network Security 3(3), 215–224 (2006)

    Google Scholar 

  41. Zheng, Y.: The SPEED Cipher. In: Hirschfeld, R. (ed.) FC 1997. LNCS, vol. 1318, pp. 71–90. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  42. Zheng, Y., Matsumoto, T., Imai, H.: On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 461–480. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computational Science and Engineering, Nagoya University, Japan

    Shingo Yanagihara & Tetsu Iwata

Authors
  1. Shingo Yanagihara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tetsu Iwata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, 100190, Beijing, China

    Dongdai Lin

  2. Computer Science Department, University of California, 92697-3435, Irvine, CA, USA

    Gene Tsudik

  3. Shandong University, China

    Xiaoyun Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yanagihara, S., Iwata, T. (2011). On Permutation Layer of Type 1, Source-Heavy, and Target-Heavy Generalized Feistel Structures. In: Lin, D., Tsudik, G., Wang, X. (eds) Cryptology and Network Security. CANS 2011. Lecture Notes in Computer Science, vol 7092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25513-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25513-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25512-0

  • Online ISBN: 978-3-642-25513-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation