Skip to main content

On 3-to-1 and Power APN S-Boxes

  • Conference paper
  • 957 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5203))

Abstract

Almost Perfect Nonlinear (APN) S-boxes are used in block ciphers to prevent differential attacks. The non-evidence of permutation APN S-box on even number of variables and the efficiency of power functions bring the importance of power APN S-boxes to use in block ciphers. We present a special class of 3-to-1 S-box (named as S3-to-1 S-box) on even number of variables. The power APN S-boxes on even number of variables fall in this class. Further, another important class of APN functions X 3 + tr(X 9) too falls in this class. We study some results of S3-to-1 S-boxes. In another section we present a necessary condition for power functions to be APN. Using this necessary condition we can filter out some non-APN power functions. Specifically, if the number of variables is multiple of small primes, then one can filter out many non-APN functions.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berger, T.P., Canteaut, A., Charpin, P., Laigle-Chapuy, Y.: Almost Perfect Nonlinear functions. IEEE Trans. Inform. Theory 52(9), 4160–4170 (2006)

    Article  MathSciNet  Google Scholar 

  2. Biham, E., Shamir, A.: Differential Cryptanalysis of DES-like Cryptosystem. Journal of Cryptology 4(1), 3–72 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Budaghyan, L., Carlet, C., Leander, G.: Constructing new APN functions from known ones. Cryptology ePrint Archive: report 2007/063

    Google Scholar 

  4. Carlet, C., Charpin, P., Zinoviev, V.: Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems. Des. Codes Cryptogr. 15(2), 125–156 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Charpin, P., Tietävämen, A., Zinoviev, V.: On binary cyclic codes with minimum distance d = 3. Problems Inform. Transmission 33(4), 287–296 (1997)

    MATH  MathSciNet  Google Scholar 

  6. Comtet, L.: Advanced combinatorics. Reidel Publication (1974)

    Google Scholar 

  7. Nyberg, K., Knudsen, L.R.: Provable security against differential cryptanalysis. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 566–574. Springer, Heidelberg (1993)

    Google Scholar 

  8. Nyberg, K.: Differentially uniform mappings for cryptography. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 55–64. Springer, Heidelberg (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Solomon W. Golomb Matthew G. Parker Alexander Pott Arne Winterhof

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dalai, D.K. (2008). On 3-to-1 and Power APN S-Boxes. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds) Sequences and Their Applications - SETA 2008. SETA 2008. Lecture Notes in Computer Science, vol 5203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85912-3_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85912-3_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85911-6

  • Online ISBN: 978-3-540-85912-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics