Skip to main content

On the Diffusion Property of Iterated Functions

  • Conference paper
  • First Online:
Book cover Cryptography and Coding (IMACC 2015)

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

Included in the following conference series:

Abstract

For vectorial Boolean functions, the behavior of iteration has consequence in the diffusion property of the system. We present a study on the diffusion property of iterated vectorial Boolean functions. The measure that will be of main interest here is the notion of the degree of completeness, which has been suggested by the NESSIE project. We provide the first (to the best of our knowledge) two constructions of (nn)-functions having perfect diffusion property and optimal algebraic degree. We also obtain the complete enumeration results for the constructed functions.

This work is supported by the National Key Basic Research Program of China under Grant 2013CB834204.

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

Access this chapter

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 EPUB and 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

References

  1. Bard, G.V.: Algebraic Cryptanalysis. Springer, New York (2009)

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257–397. Cambridge University Press, London (2010)

    Chapter  Google Scholar 

  4. Carlet, C.: Vectorial Boolean functions for cryptography. In: Crama, Y., Hammer, P. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 398–469. Cambridge University Press, London (2010)

    Chapter  Google Scholar 

  5. Courtois, N.T., Pieprzyk, J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 267–287. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Daemen, J.: Cipher and hash function design strategies based on linear and differential cryptanalysis. Ph.D. thesis, Catholic University of Louvain (1995)

    Google Scholar 

  7. Feistel, H.: Cryptography and computer privacy. Sci. Am. 228(5), 15–23 (1973)

    Article  Google Scholar 

  8. Fischer, S., Meier, W.: Algebraic immunity of S-boxes and augmented functions. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 366–381. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Forré, R.: Methods and instruments for designing S-boxes. J. Cryptol. 2(3), 115–130 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kam, J.B., Davida, G.I.: Structured design of substitution-permutation encryption networks. IEEE Trans. Comput. C–28(10), 747–753 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, New York (1997)

    MATH  Google Scholar 

  12. 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 

  13. Maximov, A.: Classes of plateaued rotation symmetric Boolean functions under transformation of Walsh spectra. Cryptology ePrint Archive, Report 2004/354 (2004). https://eprint.iacr.org/2004/354

  14. Pieprzyk, J., Qu, C.X.: Fast hashing and rotation-symmetric functions. J. Univers. Comput. Sci. 5(1), 20–31 (1999)

    MathSciNet  Google Scholar 

  15. Preneel, B., Bosselaers, A., Rijmen, V., et al.: Comments by the NESSIE project on the AES finalists (2000). http://www.nist.gov/aes

  16. Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656–715 (1949)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The authors would like to thank the anonymous referees for their helpful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sihem Mesnager .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, J., Mesnager, S., Chen, L. (2015). On the Diffusion Property of Iterated Functions. In: Groth, J. (eds) Cryptography and Coding. IMACC 2015. Lecture Notes in Computer Science(), vol 9496. Springer, Cham. https://doi.org/10.1007/978-3-319-27239-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27239-9_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27238-2

  • Online ISBN: 978-3-319-27239-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics