Skip to main content
Erschienen in: Cryptography and Communications 2/2020

24.07.2019

New constructions of involutions over finite fields

verfasst von: Tailin Niu, Kangquan Li, Longjiang Qu, Qiang Wang

Erschienen in: Cryptography and Communications | Ausgabe 2/2020

Einloggen

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

search-config
loading …

Abstract

Involutions over finite fields are permutations whose compositional inverses are themselves. Involutions especially over \( \mathbb {F}_{q} \) with q is even have been used in many applications, including cryptography and coding theory. The explicit study of involutions (including their fixed points) has started with the paper (Charpin et al. IEEE Trans. Inf. Theory, 62(4), 2266–2276 2016) for binary fields and since then a lot of attention had been made in this direction following it; see for example, Charpin et al. (2016), Coulter and Mesnager (IEEE Trans. Inf. Theory, 64(4), 2979–2986, 2018), Fu and Feng (2017), Wang (Finite Fields Appl., 45, 422–427, 2017) and Zheng et al. (2019). In this paper, we study constructions of involutions over finite fields by proposing an involutory version of the AGW Criterion. We demonstrate our general construction method by considering polynomials of different forms. First, in the multiplicative case, we present some necessary conditions of f(x) = xrh(xs) over \(\mathbb {F}_{q}\) to be involutory on \(\mathbb {F}_{q}\), where s∣(q − 1). Based on this, we provide three explicit classes of involutions of the form xrh(xq− 1) over \(\mathbb {F}_{q^{2}}\). Recently, Zheng et al. (Finite Fields Appl., 56, 1–16 2019) found an equivalent relationship between permutation polynomials of \(g(x)^{q^{i}} - g(x) + cx +(1-c)\delta \) and \(g\left (x^{q^{i}} - x + \delta \right ) +c x\). The other part work of this paper is to consider the involutory property of these two classes of permutation polynomials, which fall into the additive case of the AGW criterion. On one hand, we reveal the relationship of being involutory between the form \( g(x)^{q^{i}} - g(x) + cx +(1-c)\delta \) and the form \( g\left (x^{q^{i}} - x + \delta \right ) +c x \) over \( \mathbb {F}_{q^{m}} \) ; on the other hand, the compositional inverses of permutation polynomials of the form \( g\left (x^{q^{i}} - x + \delta \right ) + cx \) over \( \mathbb {F}_{q^{m}} \) are computed, where \( \delta \in \mathbb {F}_{q^{m}} \), \( g(x) \in \mathbb {F}_{q^{m}}[x] \) and integers m, i satisfy 1 ≤ im − 1. In addition, a class of involutions of the form \( g\left (x^{q^{i}} - x + \delta \right ) + cx \) is constructed. Finally, we study the fixed points of constructed involutions and compute the number of all involutions with any given number of fixed points over \( \mathbb {F}_{q} \).

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!

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!

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!

Literatur
1.
Zurück zum Zitat Akbary, A., Ghioca, D., Wang, Q.: On constructing permutations of finite fields. Finite Fields Appl. 17(1), 51–67 (2011)MathSciNetCrossRef Akbary, A., Ghioca, D., Wang, Q.: On constructing permutations of finite fields. Finite Fields Appl. 17(1), 51–67 (2011)MathSciNetCrossRef
2.
Zurück zum Zitat Ball, S., Zieve, M.: Symplectic spreads and permutation polynomials. In: Finite Fields and Applications, pp 79–88. Springer (2004) Ball, S., Zieve, M.: Symplectic spreads and permutation polynomials. In: Finite Fields and Applications, pp 79–88. Springer (2004)
3.
Zurück zum Zitat Barreto, P., Rijmen, V.: The anubis block cipher submission to the nessie project (2000) Barreto, P., Rijmen, V.: The anubis block cipher submission to the nessie project (2000)
4.
Zurück zum Zitat Barreto, P.S.L.M., Rijmen, V.: The khazad legacy-level block cipher. Primitive submitted to NESSIE, 97 (2000) Barreto, P.S.L.M., Rijmen, V.: The khazad legacy-level block cipher. Primitive submitted to NESSIE, 97 (2000)
5.
Zurück zum Zitat Borghoff, J., Canteaut, A., Güneysu, T., Kavun, E.B., Knezevic, M., Knudsen, L.R., Leander, G., Nikov, V., Paar, C., Rechberger, C., et al.: Prince–a low-latency block cipher for pervasive computing applications. In: International Conference on the Theory and Application of Cryptology and Information Security, pp 208–225. Springer (2012) Borghoff, J., Canteaut, A., Güneysu, T., Kavun, E.B., Knezevic, M., Knudsen, L.R., Leander, G., Nikov, V., Paar, C., Rechberger, C., et al.: Prince–a low-latency block cipher for pervasive computing applications. In: International Conference on the Theory and Application of Cryptology and Information Security, pp 208–225. Springer (2012)
6.
Zurück zum Zitat Canteaut, A., Roué, J.: On the behaviors of affine equivalent S-boxes regarding differential and linear attacks. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp 45–74. Springer (2015) Canteaut, A., Roué, J.: On the behaviors of affine equivalent S-boxes regarding differential and linear attacks. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp 45–74. Springer (2015)
7.
Zurück zum Zitat Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Crypt. 15(2), 125–156 (1998)MathSciNetCrossRef Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Crypt. 15(2), 125–156 (1998)MathSciNetCrossRef
8.
Zurück zum Zitat Cepak, N., Charpin, P., Pasalic, E.: Permutations via linear translators. Finite Fields Appl. 45, 19–42 (2017)MathSciNetCrossRef Cepak, N., Charpin, P., Pasalic, E.: Permutations via linear translators. Finite Fields Appl. 45, 19–42 (2017)MathSciNetCrossRef
9.
Zurück zum Zitat Charpin, P., Mesnager, S., Sarkar, S.: Dickson polynomials that are involutions. In: Contemporary Developments in Finite Fields and Applications, pp 22–47. World Scientific (2016) Charpin, P., Mesnager, S., Sarkar, S.: Dickson polynomials that are involutions. In: Contemporary Developments in Finite Fields and Applications, pp 22–47. World Scientific (2016)
10.
Zurück zum Zitat Charpin, P., Mesnager, S., Sarkar, S.: Involutions over the galois field \(\mathbb {F}_{2^{n}}\). IEEE Trans. Inf. Theory 62(4), 2266–2276 (2016)CrossRef Charpin, P., Mesnager, S., Sarkar, S.: Involutions over the galois field \(\mathbb {F}_{2^{n}}\). IEEE Trans. Inf. Theory 62(4), 2266–2276 (2016)CrossRef
11.
Zurück zum Zitat Coulter, R.S., Henderson, M.: The compositional inverse of a class of permutation polynomials over a finite field. Bull. Aust. Math. Soc. 65(3), 521–526 (2002)MathSciNetCrossRef Coulter, R.S., Henderson, M.: The compositional inverse of a class of permutation polynomials over a finite field. Bull. Aust. Math. Soc. 65(3), 521–526 (2002)MathSciNetCrossRef
12.
Zurück zum Zitat Coulter, R.S., Mesnager, S.: Bent functions from involutions over \(\mathbb {F}_{2^{n}}\). IEEE Trans. Inf. Theory 64(4), 2979–2986 (2018)CrossRef Coulter, R.S., Mesnager, S.: Bent functions from involutions over \(\mathbb {F}_{2^{n}}\). IEEE Trans. Inf. Theory 64(4), 2979–2986 (2018)CrossRef
13.
Zurück zum Zitat Daemen, J., Rijmen, V.: The Design of Rijndael: AES-the Advanced Encryption Standard. Springer Science & Business Media (2013) Daemen, J., Rijmen, V.: The Design of Rijndael: AES-the Advanced Encryption Standard. Springer Science & Business Media (2013)
14.
Zurück zum Zitat Dempwolff, U., Müller, P.: Permutation polynomials and translation planes of even order. Adv. Geom. 13(2), 293–313 (2013)MathSciNetCrossRef Dempwolff, U., Müller, P.: Permutation polynomials and translation planes of even order. Adv. Geom. 13(2), 293–313 (2013)MathSciNetCrossRef
15.
16.
Zurück zum Zitat Ding, C., Yuan, J.: A family of skew hadamard difference sets. J. Comb. Theory Series A 113(7), 1526–1535 (2006)MathSciNetCrossRef Ding, C., Yuan, J.: A family of skew hadamard difference sets. J. Comb. Theory Series A 113(7), 1526–1535 (2006)MathSciNetCrossRef
17.
Zurück zum Zitat Ding, C., Qu, L., Wang, Q., Yuan, J., Yuan, P.: Permutation trinomials over finite fields with even characteristic. SIAM J. Discret. Math. 29(1), 79–92 (2015)MathSciNetCrossRef Ding, C., Qu, L., Wang, Q., Yuan, J., Yuan, P.: Permutation trinomials over finite fields with even characteristic. SIAM J. Discret. Math. 29(1), 79–92 (2015)MathSciNetCrossRef
18.
Zurück zum Zitat Dobbertin, H.: Almost perfect nonlinear power functions on GF(2n): The Niho case. Inf. Comput. 151(1-2), 57–72 (1999)MathSciNetCrossRef Dobbertin, H.: Almost perfect nonlinear power functions on GF(2n): The Niho case. Inf. Comput. 151(1-2), 57–72 (1999)MathSciNetCrossRef
19.
Zurück zum Zitat Dobbertin, H.: Almost perfect nonlinear power functions on GF(2n): The Welch case. IEEE Trans. Inf. Theory 45(4), 1271–1275 (1999)MathSciNetCrossRef Dobbertin, H.: Almost perfect nonlinear power functions on GF(2n): The Welch case. IEEE Trans. Inf. Theory 45(4), 1271–1275 (1999)MathSciNetCrossRef
20.
Zurück zum Zitat Feng, X., Lin, D., Wang, L., Wang, Q.: Further results on complete permutation monomials over finite fields. Finite Fields Appl. 57, 47–59 (2019)MathSciNetCrossRef Feng, X., Lin, D., Wang, L., Wang, Q.: Further results on complete permutation monomials over finite fields. Finite Fields Appl. 57, 47–59 (2019)MathSciNetCrossRef
23.
Zurück zum Zitat Gupta, R., Sharma, R.K.: Some new classes of permutation trinomials over finite fields with even characteristic. Finite Fields Appl. 41, 89–96 (2016)MathSciNetCrossRef Gupta, R., Sharma, R.K.: Some new classes of permutation trinomials over finite fields with even characteristic. Finite Fields Appl. 41, 89–96 (2016)MathSciNetCrossRef
24.
Zurück zum Zitat Hou, X.-d.: Determination of a type of permutation trinomials over finite fields, ii. Finite Fields Appl. 35, 16–35 (2015)MathSciNetCrossRef Hou, X.-d.: Determination of a type of permutation trinomials over finite fields, ii. Finite Fields Appl. 35, 16–35 (2015)MathSciNetCrossRef
25.
Zurück zum Zitat Hou, X.-d.: Permutation polynomials over finite fields—a survey of recent advances. Finite Fields Appl. 32, 82–119 (2015)MathSciNetCrossRef Hou, X.-d.: Permutation polynomials over finite fields—a survey of recent advances. Finite Fields Appl. 32, 82–119 (2015)MathSciNetCrossRef
26.
27.
Zurück zum Zitat Li, K., Qu, L., Xi, C.: New classes of permutation binomials and permutation trinomials over finite fields. Finite Fields Appl. 43, 69–85 (2017)MathSciNetCrossRef Li, K., Qu, L., Xi, C.: New classes of permutation binomials and permutation trinomials over finite fields. Finite Fields Appl. 43, 69–85 (2017)MathSciNetCrossRef
28.
Zurück zum Zitat Li, K., Qu, L., Chen, X., Li, C.: Permutation polynomials of the form \( cx + \text {Tr}_{q^{n}/q}(x^{a}) \) and permutation trinomials over finite fields with even characteristic. Cryptogr. Commun. 10(3), 531–554 (2018)MathSciNetCrossRef Li, K., Qu, L., Chen, X., Li, C.: Permutation polynomials of the form \( cx + \text {Tr}_{q^{n}/q}(x^{a}) \) and permutation trinomials over finite fields with even characteristic. Cryptogr. Commun. 10(3), 531–554 (2018)MathSciNetCrossRef
29.
Zurück zum Zitat Li, K., Qu, L., Wang, Q.: New constructions of permutation polynomials of the form xrh (xq− 1) over \(\mathbb {F}_{q^{2}}\). Des. Codes Cryptogr. 86(10), 2379–2405 (2018)MathSciNetCrossRef Li, K., Qu, L., Wang, Q.: New constructions of permutation polynomials of the form xrh (xq− 1) over \(\mathbb {F}_{q^{2}}\). Des. Codes Cryptogr. 86(10), 2379–2405 (2018)MathSciNetCrossRef
31.
Zurück zum Zitat Li, N., Helleseth, T.: Several classes of permutation trinomials from Niho exponents. Cryptogr. Commun. 9(6), 693–705 (2017)MathSciNetCrossRef Li, N., Helleseth, T.: Several classes of permutation trinomials from Niho exponents. Cryptogr. Commun. 9(6), 693–705 (2017)MathSciNetCrossRef
33.
Zurück zum Zitat Lidl, R., Müller, W.B.: Permutation polynomials in RSA-cryptosystems. In: Advances in Cryptology, pp 293–301. Springer (1984) Lidl, R., Müller, W.B.: Permutation polynomials in RSA-cryptosystems. In: Advances in Cryptology, pp 293–301. Springer (1984)
34.
Zurück zum Zitat Lidl, R., Niederreiter, H.: Finite Fields, vol. 20. Cambridge university press (1997) Lidl, R., Niederreiter, H.: Finite Fields, vol. 20. Cambridge university press (1997)
35.
Zurück zum Zitat Ma, J., Zhang, T., Feng, T., Ge, G.: Some new results on permutation polynomials over finite fields. Des. Codes Crypt. 83(2), 425–443 (2017)MathSciNetCrossRef Ma, J., Zhang, T., Feng, T., Ge, G.: Some new results on permutation polynomials over finite fields. Des. Codes Crypt. 83(2), 425–443 (2017)MathSciNetCrossRef
36.
Zurück zum Zitat McFarland, R.L.: A family of difference sets in non-cyclic groups. J. Comb. Theory Series A 15(1), 1–10 (1973)MathSciNetCrossRef McFarland, R.L.: A family of difference sets in non-cyclic groups. J. Comb. Theory Series A 15(1), 1–10 (1973)MathSciNetCrossRef
38.
Zurück zum Zitat Mullen, G.L., Wang, Q.: Permutation polynomials of one variable. In: Handbook of Finite Fields, pp 215–230. CRC (2014) Mullen, G.L., Wang, Q.: Permutation polynomials of one variable. In: Handbook of Finite Fields, pp 215–230. CRC (2014)
39.
Zurück zum Zitat Muller, W.B.: Some remarks on public key cryptography. Studia Sci. Math. Hung. 16, 71–76 (1981)MATH Muller, W.B.: Some remarks on public key cryptography. Studia Sci. Math. Hung. 16, 71–76 (1981)MATH
40.
Zurück zum Zitat Park, Y.H., Lee, J.B.: Permutation polynomials and group permutation polynomials. Bull. Aust. Math. Soc. 63(1), 67–74 (2001)MathSciNetCrossRef Park, Y.H., Lee, J.B.: Permutation polynomials and group permutation polynomials. Bull. Aust. Math. Soc. 63(1), 67–74 (2001)MathSciNetCrossRef
41.
Zurück zum Zitat Tuxanidy, A., Wang, Q.: On the inverses of some classes of permutations of finite fields. Finite Fields Appl. 28, 244–281 (2014)MathSciNetCrossRef Tuxanidy, A., Wang, Q.: On the inverses of some classes of permutations of finite fields. Finite Fields Appl. 28, 244–281 (2014)MathSciNetCrossRef
42.
Zurück zum Zitat Tuxanidy, A., Wang, Q.: Compositional inverses and complete mappings over finite fields. Discret. Appl. Math. 217, 318–329 (2017)MathSciNetCrossRef Tuxanidy, A., Wang, Q.: Compositional inverses and complete mappings over finite fields. Discret. Appl. Math. 217, 318–329 (2017)MathSciNetCrossRef
43.
Zurück zum Zitat Wang, Q.: Cyclotomic mapping permutation polynomials over finite fields. In: Sequences, Subsequences, and Consequences, pp 119–128. Springer (2007) Wang, Q.: Cyclotomic mapping permutation polynomials over finite fields. In: Sequences, Subsequences, and Consequences, pp 119–128. Springer (2007)
44.
Zurück zum Zitat Wang, Q.: A note on inverses of cyclotomic mapping permutation polynomials over finite fields. Finite Fields Appl. 45, 422–427 (2017)MathSciNetCrossRef Wang, Q.: A note on inverses of cyclotomic mapping permutation polynomials over finite fields. Finite Fields Appl. 45, 422–427 (2017)MathSciNetCrossRef
45.
Zurück zum Zitat Wang, Q.: Polynomials over finite fields: an index approach. In: Combinatorics and Finite Fields. Difference Sets, Polynomials, Pseudorandomness and Applications, pp 1–30. Degruyter (2019) Wang, Q.: Polynomials over finite fields: an index approach. In: Combinatorics and Finite Fields. Difference Sets, Polynomials, Pseudorandomness and Applications, pp 1–30. Degruyter (2019)
46.
Zurück zum Zitat Wu, B.: The compositional inverse of a class of linearized permutation polynomials over f2n, n odd. Finite Fields Appl. 29, 34–48 (2014)MathSciNetCrossRef Wu, B.: The compositional inverse of a class of linearized permutation polynomials over f2n, n odd. Finite Fields Appl. 29, 34–48 (2014)MathSciNetCrossRef
47.
Zurück zum Zitat Wu, B., Liu, Z.: The compositional inverse of a class of bilinear permutation polynomials over finite fields of characteristic 2. Finite Fields Appl. 24, 136–147 (2013)MathSciNetCrossRef Wu, B., Liu, Z.: The compositional inverse of a class of bilinear permutation polynomials over finite fields of characteristic 2. Finite Fields Appl. 24, 136–147 (2013)MathSciNetCrossRef
48.
Zurück zum Zitat Youssef, A.M., Mister, S., Tavares, S.E.: On the design of linear transformations for substitution permutation encryption networks. In: Workshop on Selected Areas of Cryptography (SAC’96): Workshop Record, pp 40–48 (1997) Youssef, A.M., Mister, S., Tavares, S.E.: On the design of linear transformations for substitution permutation encryption networks. In: Workshop on Selected Areas of Cryptography (SAC’96): Workshop Record, pp 40–48 (1997)
49.
Zurück zum Zitat Yuan, P., Ding, C.: Permutation polynomials over finite fields from a powerful lemma. Finite Fields Appl. 17(6), 560–574 (2011)MathSciNetCrossRef Yuan, P., Ding, C.: Permutation polynomials over finite fields from a powerful lemma. Finite Fields Appl. 17(6), 560–574 (2011)MathSciNetCrossRef
50.
Zurück zum Zitat Zha, Z., Hu, L., Fan, S.: Further results on permutation trinomials over finite fields with even characteristic. Finite Fields Appl. 45, 43–52 (2017)MathSciNetCrossRef Zha, Z., Hu, L., Fan, S.: Further results on permutation trinomials over finite fields with even characteristic. Finite Fields Appl. 45, 43–52 (2017)MathSciNetCrossRef
52.
Zurück zum Zitat Zheng, D., Mu, Y., Yu, L.: Two types of permutation polynomials with special forms. Finite Fields Appl. 56, 1–16 (2019)MathSciNetCrossRef Zheng, D., Mu, Y., Yu, L.: Two types of permutation polynomials with special forms. Finite Fields Appl. 56, 1–16 (2019)MathSciNetCrossRef
53.
Zurück zum Zitat Zieve, M.E.: On some permutation polynomials over \(\mathbb {F}_{q}\) of the form xrh(x(q− 1)/d). Proc. Am. Math. Soc., 2209–2216 (2009) Zieve, M.E.: On some permutation polynomials over \(\mathbb {F}_{q}\) of the form xrh(x(q− 1)/d). Proc. Am. Math. Soc., 2209–2216 (2009)
Metadaten
Titel
New constructions of involutions over finite fields
verfasst von
Tailin Niu
Kangquan Li
Longjiang Qu
Qiang Wang
Publikationsdatum
24.07.2019
Verlag
Springer US
Erschienen in
Cryptography and Communications / Ausgabe 2/2020
Print ISSN: 1936-2447
Elektronische ISSN: 1936-2455
DOI
https://doi.org/10.1007/s12095-019-00386-2

Weitere Artikel der Ausgabe 2/2020

Cryptography and Communications 2/2020 Zur Ausgabe