Skip to main content

Abstract

In the paper the differential and the linear approximations of two classes of S-box functions are considered. The classes are the permutations and arbitrary functions with n binary inputs and m binary outputs, where 1 ≤ n=m ≤10. For randomly chosen functions from each of the classes, the distribution of the best nonzero approximations is investigated. The based on the definitions of differential and linear approximation algorithms to compute a single element of the approximation tables, are of exponential complexity. The presented in the paper fast algorithms compute the best nonzero approximations in at worst linear time for a single element, without memory needed for storage of the whole table.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Biham, E., Shamir, A.: Differential Cryptanalysis of the Data Encryption Standard. Springer-Verlag, Berlin Heidelberg New York (1993)

    MATH  Google Scholar 

  2. Chmiel, K.: Linear Approximation of some S-box Functions. Proceedings of the Regional Conference on Military Communication and Information Systems 2001, Vol. 1. WIŁ, Zegrze (2001) 211–218

    Google Scholar 

  3. Chmiel, K.: Linear Approximation of Arithmetic Sum Function. In: Sołdek, J., Drobiazgiewicz, L. (eds.): Artificial Intelligence and Security in Computing Systems. Kluwer Academic Publishers, Boston Dordrecht London (2003) 293–302

    Google Scholar 

  4. Chmiel, K.: Fast Computation of Approximation Tables. In: Saeed, K., Pejaś, J. (eds.): Information Processing and Security Systems. Springer-Verlag, Berlin Heidelberg New York (2005) 125–134

    Chapter  Google Scholar 

  5. Chmiel, K.: On Arithmetic Subtraction Linear Approximation. In: Pejaś, J., Piegat, A. (eds.): Enhanced Methods in Computer Security, Biometric and Artificial Intelligence Systems. Kluwer Academic Publishers, New York (2005) 125–134

    Chapter  Google Scholar 

  6. Górska, A., Górski, K., Kotulski, Z., Paszkiewicz, A., Szczepański, J.: New Experimental Results in Differential — Linear Cryptanalysis of Reduced Variants of DES. Proceedings of the 8-th International Conference on Advanced Computer Systems ACS’2001, Vol. 1. Szczecin (2001) 333–346

    Google Scholar 

  7. Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.): Advances in Cryptology Eurocrypt’93 (1993) 386–397

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, LLC

About this paper

Cite this paper

Chmiel, K. (2006). On Differential and Linear Approximation of S-box Functions. In: Saeed, K., Pejaś, J., Mosdorf, R. (eds) Biometrics, Computer Security Systems and Artificial Intelligence Applications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-36503-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-36503-9_11

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-36232-8

  • Online ISBN: 978-0-387-36503-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics