nach oben

Applicable Algebra in Engineering, Communication and Computing

Erschienen in:

06.08.2021 | Original Paper

Using double Weil sums in finding the c-boomerang connectivity table for monomial functions on finite fields

verfasst von: Pantelimon Stănică

Erschienen in: Applicable Algebra in Engineering, Communication and Computing | Ausgabe 4/2023

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In this paper we characterize the c-Boomerang Connectivity Table (BCT), \(c\ne 0\) (thus, including the classical \(c=1\) case), for all monomial function \(x^d\) in terms of characters and Weil sums on the finite field \({\mathbb F}_{p^n}\), for an odd prime p. We further simplify these expressions for the Gold functions \(x^{p^k+1}\) for all \(1\le k<n\), and p odd. It is the first such attempt for a complete description for the classical BCT and its relative c-BCT, for all parameters involved, albeit in terms of characters.

Vorheriger Artikel Special LCD codes from products of graphs

Nächster Artikel Rational homotopy theory methods in graph theory

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

E. Biham, O. Dunkelman, N. Keller, New results on boomerang and rectangle attacks, In: Daemen J., Rijmen V. (eds.), Fast Software Encryption, FSE 2002, LNCS 2365, 2002, pp. 1–16, Springer, Berlin, Heidelberg

A. Biryukov, D. Khovratovich, Related-key cryptanalysis of the full AES-\(192\) and AES-\(256\), In: Matsui M. (ed.), Adv. in Crypt. – ASIACRYPT 2009, LNCS 5912, 2009, pp. 1–18, Springer, Berlin, Heidelberg

Boura, C., Canteaut,IE A.: On the boomerang uniformity of cryptographic Sboxes. IACR Trans. Symmetric Cryptol. 3, 290–310 (2018)CrossRef

C. Boura, L. Perrin, S. Tian, Boomerang Uniformity of Popular S-box Constructions, Workshop on Cryptography and Coding 2019, Paper 15, https://www.lebesgue.fr/sites/default/files/proceedings/_20WCC/WCC/_2019/_20paper/_15.pdf

Budaghyan, L.: Construction and analysis of cryptographic functions. Springer-Verlag (2014)CrossRefMATH

Calderini, M., Villa, I.: On the boomerang uniformity of some permutation polynomials. Cryptogr. Commun. 12, 1161–1178 (2020)MathSciNetCrossRefMATH

Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P. (eds.) Boolean Methods and Models, Cambridge Univ, pp. 257–397. Press, Cambridge (2010)MATH

Carlet, C.: Vectorial Boolean Functions for Cryptography. In: Crama, Y., Hammer, P. (eds.) Boolean Methods and Models, Cambridge Univ, pp. 398–472. Press, Cambridge (2010)MATH

Carlet, C.: Characterizations of the differential uniformity of vectorial functions by the walsh transform. IEEE Trans. Inf. Theory 64(9), 6443–6453 (2018)MathSciNetCrossRefMATH

10.

Carlitz, L.: Evaluation of some exponential sums over a finite field. Math. Nachr. 96, 319–339 (1980)MathSciNetCrossRefMATH

11.

C. Cid, T. Huang, T. Peyrin, Y. Sasaki, L. Song, Boomerang Connectivity Table: a new cryptanalysis tool, In: J. B. Nielsen and V. Rijmen (eds.), Adv. in Crypt. – EUROCRYPT ’18, pp. 683–714, Cham, 2018. Springer

12.

Coulter, R.S.: Explicit evaluations of some Weil sums. Acta Arithmetica 83, 241–251 (1998)MathSciNetCrossRefMATH

13.

Coulter, R.S.: Further evaluations of Weil sums. Acta Arithmetica 86, 217–226 (1998)MathSciNetCrossRefMATH

14.

T. W. Cusick, P. Stănică, Cryptographic Boolean Functions and Applications (Ed. 2), Academic Press, San Diego, CA, 2017

15.

P. Ellingsen, P. Felke, C. Riera P. Stănică, A. Tkachenko, \(C\)-differentials, multiplicative uniformity and (almost) perfect \(c\)-nonlinearity, IEEE Trans. Inf. Theory, 2020, 66:9 (2020), 5781–5789

16.

Hasan, S.U., Pal, M., Riera, C., Stănică, P.: On the \(c\)-differential uniformity of certain maps over finite fields, Des. Codes Cryptogr. 89, 221–239 (2021)MathSciNetCrossRefMATH

17.

Kelsey, J., Kohno, T., Schneier, B., Amplified boomerang attacks against reduced-round MARS and Serpent, In: Goos G., Hartmanis J., van Leeuwen J., Schneier B. (eds,), Fast Software Encryption, FSE, : LNCS 1978. Springer, Berlin, Heidelberg (2000)

18.

Kim, J., Hong, S., Preneel, B., Biham, E., Dunkelman, O.: Related-key boomerang and rectangle attacks: theory and experimental analysis. IEEE Trans. Inf. Theory 58(7), 4948–4966 (2012)MathSciNetCrossRefMATH

19.

Li, K., Qu, L., Sun, B., Li, C.: New results about the boomerang uniformity of permutation polynomials. IEEE Trans. Inf. Theory 65(11), 7542–7553 (2019)MathSciNetCrossRefMATH

20.

N. Li, Z. Hu, M. Xiong, X. Zeng, \(4\)-uniform BCT permutations from generalized butterfly structure, https://arxiv.org/abs/2001.00464

21.

R. Lidl, H. Niederreiter, Finite Fields (Ed. 2), Encycl. Math. Appl., vol.20, Cambridge Univ. Press, Cambridge, 1997

22.

Mesnager, S.: Bent functions: fundamentals and results. Springer Verlag (2016)CrossRefMATH

23.

Mesnager, S., Riera, C., Stănică, P., Yan, H., Zhou, Z.: Investigation on c-(almost) perfect nonlinear functions. IEEE Trans. Inf. Theory (2021). https://doi.org/10.1109/TIT.2021.3081348MathSciNetCrossRefMATH

24.

Mesnager, S., Tang, C., Xiong, M.: On the boomerang uniformity of quadratic permutations, Des. Codes Cryptogr. 88, 2233–2246 (2020)MathSciNetCrossRefMATH

25.

C. Riera, P. Stănică, Investigations on \(c\)-(almost) perfect nonlinear functions, https://arxiv.org/abs/2004.02245

26.

Stănică, P.: Investigations on c-boomerang uniformity and perfect nonlinearity. Discret. Appl. Math. (2020). https://arxiv.org/abs/2004.11859

27.

Stănică, P.: Low \(c\)-differential and c-boomerang uniformity of the swapped inverse function. Discrete Mathematics 344(10), 112543 (2021)MathSciNetCrossRefMATH

28.

Stănică, P., Geary, A.: The \(c\)-differential behavior of the inverse function under the \(EA\)-equivalence. Cryptogr. Commun. 13, 295–306 (2021)MathSciNetCrossRefMATH

29.

Tokareva, N.: Bent Functions. Academic Press, San Diego, CA, Results and Applications to Cryptography (2015)CrossRefMATH

30.

Tu, Z., Li, N., Zeng, X., Zhou, J.: A class of quadrinomial permutation with boomerang uniformity four. IEEE Trans. Inf. Theory 66(6), 3753–3765 (2020)MathSciNetCrossRefMATH

31.

Yan, H., Mesnager, S., Zhou, Z.: Power functions over finite fields with low c-differential uniformity. https://arxiv.org/pdf/2003.13019.pdf

32.

D. Wagner, The boomerang attack, In: L. R. Knudsen (ed.), Fast Software Encryption, FSE ’99, LNCS 1636, pages 156–170, 1999, Springer, Heidelberg

33.

Y. Wu, N. Li, X. Zeng, New P\(c\)N and AP\(c\)N functions over finite fields, https://arxiv.org/pdf/2010.05396.pdf

34.

Zheng, Y., Wang, Q., Wei, W.: On inverses of permutation polynomials of small degree over finite fields. IEEE Trans. Inf. Theory 66(2), 914–922 (2020)MathSciNetCrossRefMATH

Titel: Using double Weil sums in finding the c-boomerang connectivity table for monomial functions on finite fields
verfasst von: Pantelimon Stănică
Publikationsdatum: 06.08.2021
Verlag: Springer Berlin Heidelberg
Erschienen in: Applicable Algebra in Engineering, Communication and Computing / Ausgabe 4/2023
Print ISSN: 0938-1279
Elektronische ISSN: 1432-0622
DOI: https://doi.org/10.1007/s00200-021-00520-9

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 4/2023

Deterministic factoring with oracles

Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction

Rational homotopy theory methods in graph theory

Several classes of p-ary linear codes with few weights

Integration in finite terms: dilogarithmic integrals

A new algorithm for equivalence of cyclic codes and its applications

Premium Partner