Skip to main content
SpringerLink
Log in

Verification of Restricted EA-Equivalence for Vectorial Boolean Functions

  • Conference paper
Arithmetic of Finite Fields (WAIFI 2012)

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

Included in the following conference series:

Abstract

We present algorithms for solving the restricted extended affine equivalence (REA-equivalence) problem for any m-dimensional vectorial Boolean functions in n variables. The best of them has complexity O(22n + 1) for REA-equivalence F(x) = M 1 ·G(x ⊕ V 2) ⊕ M 3 ·x ⊕ V 1. The algorithms are compared with previous effective algorithms for solving the linear and the affine equivalence problem for permutations by Biryukov et. al [1].

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 49.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. Biryukov, A., De Canniere, C., Braeken, A., Preneel, B.: A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 33–50. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Daemen, J., Rijmen, V.: The Design of Rijndael. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  3. Kwon, D.: New Block Cipher: ARIA. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 432–445. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Oliynykov, R., Gorbenko, I., Dolgov, V., Ruzhentsev, V.: Symmetric block cipher ”Kalyna”. Applied Radio Electronics 6, 46–63 (2007) (in Ukrainian)

    Google Scholar 

  5. Oliynykov, R., Gorbenko, I., Dolgov, V., Ruzhentsev, V.: Results of Ukrainian National Public Cryptographic Competition. Tatra Mt. Math. Publ. 47, 99–113 (2010), http://www.sav.sk/journals/uploads/0317154006ogdr.pdf

    MathSciNet  MATH  Google Scholar 

  6. Nyberg, K.: Differentially Uniform Mappings for Cryptography. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 55–64. Springer, Heidelberg (1994)

    Google Scholar 

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

    Article  MathSciNet  MATH  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)

    Chapter  Google Scholar 

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

    Google Scholar 

  10. Carlet, C.: Vectorial Boolean Functions for Cryptography. In: Crama, Y., Hammer, P. (eds.) Chapter of the Monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 398–469. Cambridge University Press (2010)

    Google Scholar 

  11. Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Designs, Codes and Cryptography 15(2), 125–156 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Williams, V.V.: Breaking the Coppersmith-Winograd barrier (November 2011), http://www.cs.berkeley.edu/~virgi/matrixmult.pdf

  13. Stein, W.A., et al.: Sage Mathematics Software (Version 4.8.2), The Sage Development Team (2012), http://www.sagemath.org

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, P.O.Box 7803, N-5020, Bergen, Norway

    Lilya Budaghyan & Oleksandr Kazymyrov

Authors
  1. Lilya Budaghyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oleksandr Kazymyrov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkey

    Ferruh Özbudak

  2. Computer Science Section, CINVESTAV, Mexico DF, Mexico

    Francisco Rodríguez-Henríquez

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Budaghyan, L., Kazymyrov, O. (2012). Verification of Restricted EA-Equivalence for Vectorial Boolean Functions. In: Özbudak, F., Rodríguez-Henríquez, F. (eds) Arithmetic of Finite Fields. WAIFI 2012. Lecture Notes in Computer Science, vol 7369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31662-3_8

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31661-6

  • Online ISBN: 978-3-642-31662-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation