Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Workshop on Fast Software Encryption

FSE 2012: Fast Software Encryption pp 1–8Cite as

  1. Home
  2. Fast Software Encryption
  3. Conference paper
“Provable” Security against Differential and Linear Cryptanalysis

“Provable” Security against Differential and Linear Cryptanalysis

  • Kaisa Nyberg17 
  • Conference paper
  • 1964 Accesses

  • 2 Citations

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

Abstract

In this invited talk, a brief survey on the developments of countermeasures against differential and linear cryptanalysis methods is presented.

Keywords

  • Boolean Function
  • Block Cipher
  • Bend Function
  • Round Function
  • Almost Perfect Nonlinear

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. Aoki, K.: On Maximum Non-averaged Differential Probability. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 118–130. Springer, Heidelberg (1999)

    CrossRef  Google Scholar 

  2. Baignères, T., Junod, P., Vaudenay, S.: How Far Can We Go Beyond Linear Cryptanalysis? In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 432–450. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  3. Baignères, T., Stern, J., Vaudenay, S.: Linear Cryptanalysis of Non Binary Ciphers. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 184–211. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

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

  5. Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M., Seurin, Y., Vikkelsoe, C.: PRESENT: An Ultra-Lightweight Block Cipher. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 450–466. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  6. Brandstätter, N., Lange, T., Winterhof, A.: On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two. In: Ytrehus, Ø. (ed.) WCC 2005. LNCS, vol. 3969, pp. 135–143. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  7. Carlet, C., Feng, K.: An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity. In: Chee, Y.M., Li, C., Ling, S., Wang, H., Xing, C. (eds.) IWCC 2009. LNCS, vol. 5557, pp. 1–11. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  8. 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)

    CrossRef  Google Scholar 

  9. Cho, J.Y.: Linear Cryptanalysis of Reduced-Round PRESENT. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 302–317. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  10. Daemen, J., Rijmen, V.: The Design of Rijndael – AES, the Advanced Encryption Standard. Springer (2002)

    Google Scholar 

  11. Daemen, J., Govaerts, R., Vandewalle, J.: Correlation Matrices. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 275–285. Springer, Heidelberg (1995)

    CrossRef  Google Scholar 

  12. Dillon, J.F.: Elementary Hadamard difference sets. In: Proceedings of the Sixth Southeastern Conference on Cornbinatorics, Graph Theory and Computing, Boca Raton, Florida. Congressus Numerantium, vol. XIV, pp. 237–249. Utilitas Math., Winnipeg, Manitoba (1975)

    Google Scholar 

  13. Hakala, R.M.: An upper bound for the linearity of Exponential Welch Costas functions. Finite Fields and Their Applications (to appear, 2012), http://dx.doi.org/10.1016/j.ffa,05.001

  14. Hakala, R.M., Nyberg, K.: On the Nonlinearity of Discrete Logarithm in \(\mathbb F_{2^n}\). In: Carlet, C., Pott, A. (eds.) SETA 2010. LNCS, vol. 6338, pp. 333–345. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  15. Hermelin, M., Cho, J.Y., Nyberg, K.: Multidimensional Linear Cryptanalysis of Reduced Round Serpent. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol. 5107, pp. 203–215. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  16. Keliher, L.: Refined Analysis of Bounds Related to Linear and Differential Cryptanalysis for the AES. In: Dobbertin, H., Rijmen, V., Sowa, A. (eds.) AES 2005. LNCS, vol. 3373, pp. 42–57. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  17. Kumar, P.V., Scholtz, R.A., Welch, L.R.: Generalized bent functions and their properties. J. Combin. Theory Ser. A 40(1), 90–107 (1985)

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. Preneel, B., Govaerts, R., Vandewalle, J.: Boolean Functions Satisfying Higher Order Propagation Criteria. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 141–152. Springer, Heidelberg (1991)

    CrossRef  Google Scholar 

  19. Leander, G.: On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 303–322. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  21. Meier, W., Staffelbach, O.: Nonlinearity Criteria for Cryptographic Functions. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 549–562. Springer, Heidelberg (1990)

    CrossRef  Google Scholar 

  22. Nyberg, K.: Perfect Nonlinear S-Boxes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 378–386. Springer, Heidelberg (1991)

    CrossRef  Google Scholar 

  23. Nyberg, K.: On the Construction of Highly Nonlinear Permutations. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 92–98. Springer, Heidelberg (1993)

    CrossRef  Google Scholar 

  24. Nyberg, K.: Linear Approximation of Block Ciphers. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 439–444. Springer, Heidelberg (1995)

    CrossRef  Google Scholar 

  25. Nyberg, K., Knudsen, L.R.: Provable security against a differential attack. Journal of Cryptology 8(1), 27–37 (1995)

    CrossRef  MathSciNet  MATH  Google Scholar 

  26. Pieprzyk, J.: On bent permutations. Tech. rep., The University of South Wales, Department of Computer Science. Presented at the International Conference on Finite Fields, Coding Theory and Advances in Communications and Computing, Las Vegas (1991)

    Google Scholar 

  27. Preneel, B., Van Leekwijck, W., Van Linden, L., Govaerts, R., Vandewalle, J.: Propagation Characteristics of Boolean Functions. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 161–173. Springer, Heidelberg (1991)

    CrossRef  Google Scholar 

  28. Rothaus, O.S.: On “bent” functions. J. Combinatorial Theory Ser. A(20), 300–305 (1976)

    Google Scholar 

  29. Siegenthaler, T.: Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory 30(5), 776–780 (1984)

    CrossRef  MathSciNet  MATH  Google Scholar 

  30. Webster, A.F., Tavares, S.: On the Design of S-boxes. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 523–534. Springer, Heidelberg (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aalto University School of Science and Nokia, Finland

    Kaisa Nyberg

Authors
  1. Kaisa Nyberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Paris-Rocquencourt, B.P. 105, 78153, Le Chesnay, France

    Anne Canteaut

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nyberg, K. (2012). “Provable” Security against Differential and Linear Cryptanalysis. In: Canteaut, A. (eds) Fast Software Encryption. FSE 2012. Lecture Notes in Computer Science, vol 7549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34047-5_1

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-34047-5_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34046-8

  • Online ISBN: 978-3-642-34047-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature