低c-差分及回旋镖均匀度置换的构造

朱思敏,  王艳,  李顺波,  付妍希

朱思敏, 王艳, 李顺波, 等. 低c-差分及回旋镖均匀度置换的构造 [J]. 首都师范大学学报(自然科学版), 2025, 46(5): 20-27. DOI: 10.19789/j.1004-9398.2025.05.004
引用本文: 朱思敏, 王艳, 李顺波, 等. 低c-差分及回旋镖均匀度置换的构造 [J]. 首都师范大学学报(自然科学版), 2025, 46(5): 20-27. DOI: 10.19789/j.1004-9398.2025.05.004
ZHU Simin, WANG Yan, LI Shunbo, et al. Construction of permutations with low c-differential and boomerang uniformities [J]. Journal of Capital Normal University (Natural Science Edition), 2025, 46(5): 20-27. DOI: 10.19789/j.1004-9398.2025.05.004
Citation: ZHU Simin, WANG Yan, LI Shunbo, et al. Construction of permutations with low c-differential and boomerang uniformities [J]. Journal of Capital Normal University (Natural Science Edition), 2025, 46(5): 20-27. DOI: 10.19789/j.1004-9398.2025.05.004

低c-差分及回旋镖均匀度置换的构造

DOI: 10.19789/j.1004-9398.2025.05.004
基金项目: 

国家自然科学基金项目 61902304;

应用数学湖北省重点实验室2022年度开放基金项目 HBAM202202.

详细信息
    通讯作者:

    王艳, wangyan@xauat.edu.cn.

  • 中图分类号: TN918.1

Construction of permutations with low c-differential and boomerang uniformities

  • 摘要: 具有低c-差分均匀度及低回旋镖均匀度的向量布尔函数,尤其是几乎完全c-非线性函数,在密码学中有广泛的应用。本文利用有限域上的迹函数构造了一类新的非单项函数,通过计算Weil和获得了这类函数的c-差分分布表,并推断其在有限域上是几乎完全c-非线性函数。进而证明了已构造的函数具有低回旋镖均匀度。

     

    Abstract: Vectorial boolean functions with low c-differential and boomerang uniformities, especially the almost perfect c-nonlinear functions, are widely used in cryptography. This paper constructed a new class of non-monomial functions over finite fields by using trace functions. By calculating Weil sums we obtained the c-difference distribution table of this class of functions, and we concluded that they are almost perfect c-nonlinear functions over finite fields. Furthermore, it is proved that the constructed functions have low boomerang uniformity.

     

  • 为抵抗多种针对密码系统的攻击,设计满足相应安全性指标的密码函数受到广泛关注。学者们比较关注的密码函数安全性指标包括非线性度、平衡性、差分均匀度、c-差分均匀度和回旋镖均匀度等。

    在分组密码中,差分密码攻击[1-2]是常见的攻击方式之一。为了评估密码函数抵抗差分攻击的能力,1993年,Nyberg[3]首次提出了差分均匀度的概念。低差分均匀度函数通常是指差分均匀度值< 4的函数。对于$ \mathbb{F}_{{2}^{n}} $上的向量布尔函数,当其差分均匀度为1时,称其为完全非线性函数;当其差分均匀度为2时,称其为几乎完全非线性函数。目前,学者们对于低差分均匀度函数已经做了大量研究,参见文献[4-14, 16-20],以及其中的参考文献。

    2002年,Borisov等[11]介绍了一种新的乘法差分分析方法,即通过输入明文对$ (cx, x) $来分析输出的密文对$ \left(F\right(cx), F(x\left)\right) $。基于这种新的差分分析方法,Ellingsen等[12]提出了c-差分均匀度的概念,具体定义如下。

    定义1.1[12]  设$ n $为正整数,p为素数,$ \mathbb{F}_{{p}^{n}} $是有$ {p}^{n} $个元素的有限域,$ f $是从$ \mathbb{F}_{{p}^{n}} $到自身的函数。对于$ a, c\in \mathbb{F}_{{p}^{n}} $,$ f $的c-差分为

    $$ {}_{c}{D}_{f}\left(x, a\right)=f\left(x+a\right)+cf\left(x\right) 。 $$

    设$ {}_{c}{\Delta }_{f}(a, b)=\#\{x\in \mathbb{F}_{{p}^{n}}{:}_{c}{D}_{a}f(x)=b\} $,其中$ b\in \mathbb{F}_{{p}^{n}} $。称

    $$ {}_{c}{\Delta }_{f}≔\underset{a, b\in \mathbb{F}_{{p}^{n}}}{\text{max}}{\{}_{c}{\Delta }_{f}(a, b):\hspace{0.33em}若c=1, \hspace{0.33em}则a\ne 0\} $$

    为$ f $的c-差分均匀度。若$ {}_{c}{\Delta }_{f}=1 $,则称$ f $为完全c-非线性函数(perfect c-nonlinear function,PcN);若$ {}_{c}{\Delta }_{f}=2 $,则称$ f $为几乎完全c-非线性函数(almost perfect c-nonlinear function,APcN)。特别地,当$ c=1 $时,函数的1-差分均匀度即为差分均匀度。且以方程$ {}_{c}{D}_{f}(x, a)=b $的解$ x\in \mathbb{F}_{{p}^{n}} $的个数为$ (a, b) $处的值,可形成$ f $的c-差分分布表(c-difference distribution table, c-DDT),其中,c-DDT中除去第1行和第1列的最大数,即$ f $的c-差分均匀度。

    当$ c\notin \left\{\mathrm{0, 1}\right\} $时,Ellingsen等[12]研究了一些已知的幂函数以及它们逆函数的c-差分均匀度;Hasan等[15]给出线性化多项式为完全c-非线性函数的充要条件,并利用Dickson多项式研究了当$ c=-1 $时,几类幂函数的$ c $-差分均匀度;Wu等[20]运用分圆法、AGW准则等构造了几类c-差分均匀度$ \le $2的函数。Bartoli和Calderini[21]、Stanica[22]通过运用AGW准则及其推广与交换的方法构造了几类非单项式APcN函数。目前,常见的PcN和APcN幂函数可见表 1[12-18]和表 2[12, 15-16, 19]。

    表  1  $ \mathbb{F}_{p^n}$上常见的$ F(x)=x^d$型PcN幂函数
    $p$ $d$ 条件 参考文献
    任意 2 $c=0$ [12]
    2 $\left(3^k+1\right) / 2$ $c=-1, \frac{n}{\operatorname{gcd}(k, m)}=1$ [12]
    奇数 $\left(p^2+1\right) / 2$ $c=-1, m$是奇数 [13]
    奇数 $p^2-p+1$ $c=-1, m=3$ [13]
    奇数 $p^4+(p-2) p^2+(p-1)+1$ $c=-1, m=5$ [14]
    奇数 $\left(p^5+1\right) /(p+1)$ $c=-1, m=5$ [14]
    奇数 $(p-1) p^6+p^5+(p-2) p^3+(p-1) p^2+p$ $c=-1, m=7$ [14]
    奇数 $(p-1) p^6+(p-2) p^5+(p-1) p^4+p^3+p^2+p$ $c=-1, m=7$ [14]
    奇数 $\left(p^7+1\right) /(p+1)$ $c=-1, m=7$ [14]
    奇数 $\left(p^k+1\right) / 2$ $v_2(m) \leqslant v_2(k)+1, c=-1$ [15]
    2 $2^k+1$ $v_2(m) \leqslant v_2(k)+1, c \in \mathbb{F}_{2^{\operatorname{gcd}(m, k)}}$ [18]
    3 $\frac{3^k+1}{2} d \equiv \frac{3^m+1}{2}\left(\text{ mod } 3^m-1\right), d$是奇数 $k, m$是奇数,$\operatorname{gcd}(m, k)=1$ [17]
    5 $\frac{5^k+1}{2} d \equiv \frac{5^m+1}{2}\left(\text{ mod } 5^m-1\right), d$是奇数 $k, m$是正整数,$\operatorname{gcd}(2 m, k)=1$ [16]
    表  2  $ \mathbb{F}_{p^n}$上常见的$ F(x)=x^d$型APcN幂函数
    $p$ $d$ 条件 参考文献
    任意 2 $c \neq 1$ [12]
    2 $2^m-2$ $\operatorname{Tr}_1^m(c)=\operatorname{Tr}_1^m\left(c^{-1}\right)=1$ [12]
    奇数 $p^m-2$ $c=4, 4-1$或$\chi\left(c^2-4 c\right)=\chi(1-4 c)=-1$ [12]
    3 $\frac{3^n+3}{2}$ $c=-1, m$是偶数 [15]
    3 $3^n-3$ $c=0$ [15]
    奇数 $p^k+1$ $v_2(m) \leqslant v_2(k)+1, c \in \mathbb{F}_{p^{\operatorname{gcd}(m, k)}}$ [15]
    3 $\frac{3^k+1}{2}$ k是奇数,c = −1
    gcd(k,m)=1
    [16]
    2 $2^{3 n}+2^{2 n}+2^n-1$ $c \in \mathbb{F}_{2^{4 n}} \backslash\{1\}, c^{2^{2 n}+1}=1$ [19]

    回旋镖均匀度是另一个关于密码函数安全性的重要指标,刻画的是函数抵抗回旋镖攻击的能力。回旋镖攻击是由Wagner[23]提出的差分密码攻击的一种变体。为了简化回旋镖攻击的复杂度分析,Cid等[24]首次提出了回旋镖连接表(boomerang connectivity table, BCT),并分析了回旋镖连接表与差分分布表之间的关系。为了量化函数抵抗回旋镖攻击的能力,Boura和Canteaut[25]介绍了回旋镖均匀度的概念,其是回旋镖连接表中去掉第1行与第1列的最大值;Li等[26]给出了回旋镖均匀度的等价定义,并找到了$ \mathbb{F}_{{2}^{n}} $中一类4回旋镖均匀度的置换二项式。随后,Calderini和Villa[27]给出了3类4回旋镖均匀度的置换二项式;Hasan等[28]、Stanica[29]利用Weil和得到几类低回旋镖均匀度函数。本文推广了文献[28]中非单项函数的构造,并进一步研究了此类非单项式函数的c-差分均匀度与回旋镖均匀度。

    设$ p $为素数,$ n $为正整数,$ \mathbb{F}_{{p}^{n}} $是具有$ {p}^{n} $个元素的有限域,记$ \mathbb{F}_{{p}^{n}} $的乘法群为$ \mathbb{F}_{{p}^{n}}^{*} $,$ \mathbb{F}_{{p}^{n}}\left[x\right] $是$ \mathbb{F}_{{p}^{n}} $上的一元多项式环且$ \#S $表示集合$ S $中元素的个数。令正整数$ n, \hspace{0.33em}d, \hspace{0.33em}m $满足$ n=md $,定义

    $$ \text{Tr}_{d}^{n}\left(x\right)=\sum\limits_{k=0}^{m-1}{x}^{{p}^{dk}}=x+{x}^{{p}^{d}}+{x}^{{p}^{2d}}+\cdots +{x}^{{p}^{(m-1)d}} $$

    为$ \mathbb{F}_{{p}^{n}} $到$ \mathbb{F}_{{p}^{d}} $的迹函数[30]。特别地,$ \text{Tr}_{1}^{n}\left(x\right) $被称为$ \mathbb{F}_{{p}^{n}} $到$ \mathbb{F}_{p} $的绝对迹函数,简记为$ \text{Tr}\left(x\right) $。

    定义1.2[24]  设$ F $是从$ \mathbb{F}_{{p}^{n}} $到自身的可逆函数。对于$ (a, b)\in \mathbb{F}_{{p}^{n}}\times \mathbb{F}_{{p}^{n}} $,称以

    $ \mathcal{B}_F(a, b)=\#\{x\in \mathbb{F}_{{p}^{n}}:F^{-1}(F\left(x\right)+b)+F^{-1}(F(x+a)+b)=a\} $为元素的表格为$ F\left(x\right) $在$ (a, b) $处的BCT;称BCT中除去第1行第1列的最大数值$ \mathcal{B}_F≔\underset{a, b\in \mathbb{F}_{{p}^{n}}^{*}}{\text{max}}\mathcal{B}_F(a, b) $为$ F\left(x\right) $的回旋镖均匀度;此时,称$ F\left(x\right) $是一个$ \mathcal{B}_F $-回旋镖均匀度函数。

    引理1.1[26]  设$ F $是$ \mathbb{F}_{{p}^{n}} $到自身的置换。则$ F\left(x\right) $在$ (a, b) $处的BCT的值等价于满足方程组

    $$ \left\{\begin{array}{l}F\left(x\right)+F\left(y\right)=b, \\ F(x+a)+F(y+a)=b\end{array}\right. $$ (1)

    的解$ (x, y)\in \mathbb{F}_{{p}^{n}}\times \mathbb{F}_{{p}^{n}} $的个数,其中$ a, b\in \mathbb{F}_{{p}^{n}}^{*} $。

    定义1.3[31]  设$ F $是从$ \mathbb{F}_{{p}^{n}} $到自身的函数。称

    $$ \mathcal{W}_F\left(u\right)=\sum\limits_{x\in \mathbb{F}_{{p}^{n}}}{(-1)}^{F\left(x\right)+\text{Tr}\left(ux\right)}, \hspace{0.33em}u\in \mathbb{F}_{{p}^{n}} $$

    为$ F $的Walsh-Hadamard变换,其中$ \text{Tr}(\cdot ) $是$ \mathbb{F}_{{p}^{n}} $到$ \mathbb{F}_{p} $的绝对迹函数。

    定义1.4[30]  设$ {\chi }_{1}:\mathbb{F}_{{2}^{n}}\to \mathbb{C} $,

    $$ {\chi }_{1}\left(x\right)≔\text{exp}\left(\frac{2\pi i\text{Tr}\left(x\right)}{2}\right)={(-1)}^{\text{Tr}\left(x\right)} \text{,} $$

    称$ {\chi }_{1}\left(x\right) $为$ \mathbb{F}_{{2}^{n}} $的加法群的正则加法特征。

    定义1.5[30]  称$ \mathbb{F}_{{p}^{n}} $上的多项式

    $ l\left(x\right)=\sum\limits_{i=0}^{n}{a}_{i}{x}^{i} $和$ L\left(x\right)=\sum\limits_{i=0}^{n}{a}_{i}{x}^{{p}^{i}} $

    为p-相互关联的;称$ l\left(x\right) $是$ L\left(x\right) $的常规p-关联,$ L\left(x\right) $是$ l\left(x\right) $的线性化p-关联。

    定义1.6[30]  设$ F $是$ \mathbb{F}_{{p}^{n}} $到自身的函数,“$ \circ $”为映射的复合。若$ F\circ F\left(x\right)=x $,则称$ F $是$ \mathbb{F}_{{p}^{n}} $上的对合。

    引理1.2[30]  设$ F $是$ \mathbb{F}_{{2}^{n}}^{n}=\mathbb{F}_{{2}^{n}}\times \cdots \times \mathbb{F}_{{2}^{n}} $到$ \mathbb{F}_{{2}^{n}} $的任意映射。对于确定的$ b\in \mathbb{F}_{{2}^{n}} $,记方程$ F({x}_{1}, {x}_{2}, \dots , {x}_{n})=b $的解$ ({x}_{1}, {x}_{2}, \cdots , {x}_{n})\in \mathbb{F}_{{2}^{n}}^{n} $的个数为$ N\left(b\right) $,其中

    $$ \begin{array}{c}N\left(b\right)=\frac{1}{{2}^{n}}\sum\limits_{{x}_{1}\in \mathbb{F}_{{2}^{n}}}\cdots \sum\limits_{{x}_{n}\in \mathbb{F}_{{2}^{n}}}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}}{\chi }_{1}\left(\beta \right(F({x}_{1}, {x}_{2}, \dots , {x}_{n})+b\left)\right)=\\ \frac{1}{{2}^{n}}\sum\limits_{{x}_{1}\in \mathbb{F}_{{2}^{n}}}\cdots \sum\limits_{{x}_{n}\in \mathbb{F}_{{2}^{n}}}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(F({x}_{1}, {x}_{2}, \dots , {x}_{n})+b\left)\right)}。\end{array} $$ (2)

    引理1.3[30]  设$ F $是$ \mathbb{F}_{{2}^{n}}^{n} $到$ \mathbb{F}_{{2}^{n}} $的任意映射。对于确定的$ b=({b}_{1}, {b}_{2})\in \mathbb{F}_{{2}^{n}}^{2} $,记方程组$ \left\{\begin{array}{l}F_{1}({x}_{1}, {x}_{2}, \dots , {x}_{n})={b}_{1}, \\ F_{2}({x}_{1}, {x}_{2}, \dots , {x}_{n})={b}_{2}\end{array}\right. $的解$ ({x}_{1}, {x}_{2}, \cdots , {x}_{n})\in \mathbb{F}_{{2}^{n}}^{n} $的个数为$ \widehat{N}\left(b\right) $,其中

    $$ \begin{gathered} \hat{N}(b)= \\ \frac{1}{2^{2 n}} \sum\limits_{x_1 \in \mathbb{F}_{2^*}} \cdots \sum\limits_{x_n \in \mathbb{F}_{2^*}} \sum\limits_{\beta \in \mathbb{F}_{2^*}} x_1\left(\beta\left(F_1\left(x_1, x_2, \cdots, x_n\right)+b_1\right)\right) \\ \sum\limits_{\gamma \in \mathbb{F}_{2^n}} x_1\left(\gamma\left(F_2\left(x_1, x_2, \cdots, x_n\right)+b_2\right)\right)= \\ \frac{1}{2^{2 n}} \sum\limits_{x_1 \in \mathbb{F}_{2^n}} \cdots \sum\limits_{x_n \in \mathbb{F}_{2^n}} \sum\limits_{\beta \in \mathbb{F}_{2^*}}(-1)^{\operatorname{Tr}\left(\beta\left(F_1\left(x_1, x_2, \cdots, x_n\right)+b_1\right)\right)} \\ \sum\limits_{\gamma \in \mathbb{F}_{2^n}}(-1)^{\operatorname{Tr}\left(\gamma\left(F_2\left(x_1, x_2, \cdots, x_n\right)+b_2\right)\right)}。 \end{gathered} $$ (3)

    设$ n, \hspace{0.33em}k, \hspace{0.33em}i, \hspace{0.33em}m, \hspace{0.33em}d\in {\mathbb{N}}^{+} $,且$ n=2k+1 $,$ i=2m+1 $,$ m={2}^{d-1} $。构造$ \mathbb{F}_{{2}^{n}} $上的函数$ H\left(x\right) $为

    $$ H\left(x\right)=x+\text{Tr}({x}^{{2}^{k}+i}+{(x+1)}^{{2}^{k}+i}) \text{,} $$

    式中$ \text{Tr}(\cdot ) $是$ \mathbb{F}_{{2}^{n}} $到$ \mathbb{F}_{2} $的绝对迹函数。等价地,

    $$ \begin{array}{c}H\left(x\right)=x+\text{Tr}({x}^{{2}^{k}+i}+{(x+1)}^{{2}^{k}+i})=\\ x+1+\text{Tr}({x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i}+x)。\end{array} $$ (4)

    引理2.1  设$ n, \hspace{0.33em}k, \hspace{0.33em}i, \hspace{0.33em}m, \hspace{0.33em}d\in {\mathbb{N}}^{+} $,$ n= 2k+ 1 $,$ i=2m+1 $且$ m={2}^{d-1} $。则函数$ H\left(x\right)=x+\text{Tr}({x}^{{2}^{k}+i}+ $ $ {(x+1)}^{{2}^{k}+i}) $是$ \mathbb{F}_{{2}^{n}} $上的对合。

    证明  对于所有的$ x\in \mathbb{F}_{{2}^{n}} $,

    $$ \begin{array}{c}H\circ H\left(x\right)=x+\text{Tr}({x}^{{2}^{k}+i}+{(x+1)}^{{2}^{k}+i})+\\ \text{Tr}\left(\right(x+\text{Tr}({x}^{{2}^{k}+i}+{(x+1)}^{{2}^{k}+i}{\left)\right)}^{{2}^{k}+i}+\\ (x+1+\text{Tr}({x}^{{2}^{k}+i}+{(x+1)}^{{2}^{k}+i}{\left)\right)}^{{2}^{k}+i})=x。\end{array} $$

    式中

    $$ \begin{gathered} \operatorname{Tr}\left(\left(x+\operatorname{Tr}\left(x^{2^k+i}+(x+1)^{2^k+i}\right)\right)^{2^k+i}\right)= \\ \operatorname{Tr}\left(\left(x+\operatorname{Tr}\left(x^{2^k+i}+(x+1)^{2^k+i}\right)\right)^{2^k}\right. \\ \left.\left(x+\operatorname{Tr}\left(x^{2^k+i}+(x+1)^{2^k+i}\right)\right)^i\right)= \\ \operatorname{Tr}\left(\left(x+\operatorname{Tr}\left(x^{2^k+i}+(x+1)^{2^k+i}\right)\right)^{2^k}\right. \\ \left.\left(x^i+\left(x^{i-1}+x+1\right) \operatorname{Tr}\left(x^{2^k+i}+(x+1)^{2^k+i}\right)\right)\right)= \\ \operatorname{Tr}\left(x^{2^k+i}\right)+\operatorname{Tr}\left(x^{2^k+i-1}+x^{2^k+i-1}+x^{2^k+1}+x^i+x+1\right) \cdot \\ \operatorname{Tr}\left(x^{2^k+i}+(x+1)^{2^k+i}\right) \text { 。 } \\ \operatorname{Tr}\left(x+1+\operatorname{Tr}\left(x^{2^k+i}+(x+1)^{2^k+i}\right)^{2^k+i}\right)= \\ \operatorname{Tr}\left(\left((x+1)+\operatorname{Tr}\left(x^{2^k+i}+(x+1)^{2^k+i}\right)\right)^{2^k} \cdot\right. \\ \left.\left.((x+1)^i+\left((x+1)^{i-1}+x\right) \operatorname{Tr}\left(x^{2^k+i}+(x+1)^{2^k+i}\right)\right)\right)= \\ \operatorname{Tr}(x+1)^{2^k+i}+\operatorname{Tr}\left(x^{2^k+i-1}+x^{2^k+i-1}+x^{2^k+1}+x^i+\right. \\ x+1) \operatorname{Tr}\left(x^{2^k+i}+(x+1)^{2^k+i}\right) \text { 。 } \end{gathered} $$

    引理2.2  设$ n, \hspace{0.33em}k, \hspace{0.33em}i, \hspace{0.33em}m, \hspace{0.33em}d\in {\mathbb{N}}^{+} $,且$ n=2k+ 1 $,$ i=2m+1 $,$ m={2}^{d-1} $,$ \text{gcd}(n, d)=1 $,$ (k-d)|d $。设$ g\left(x\right)={x}^{{2}^{k-d}}+{x}^{{2}^{d-k}}+{x}^{{2}^{k}}+{x}^{{2}^{-k}}+{x}^{{2}^{d}}+{x}^{{2}^{-d}} $。则

    $$ \begin{array}{c}\hspace{0.33em}\hspace{0.33em}\text{Tr}({x}^{i-1}{a}^{{2}^{k}}+{x}^{{2}^{k}}{a}^{i-1}+{x}^{{2}^{k}}a+x{a}^{{2}^{k}}+{x}^{i-1}a+x{a}^{i-1})=\\ \text{Tr}\left(g\right(x\left)a\right)=\text{Tr}\left(xg\right(a\left)\right)。\end{array} $$

    证明

    $$ \begin{array}{c}\text{Tr}({x}^{i-1}{a}^{{2}^{k}}+{x}^{{2}^{k}}{a}^{i-1}+{x}^{{2}^{k}}a+x{a}^{{2}^{k}}+{x}^{i-1}a+x{a}^{i-1})=\\ \text{Tr}\left({x}^{{2}^{d}}{a}^{{2}^{k}}\right)+\text{Tr}\left({x}^{{2}^{k}}{a}^{{2}^{d}}\right)+\text{Tr}\left({x}^{{2}^{k}}a\right)+\text{Tr}\left(x{a}^{{2}^{k}}\right)+\\ \text{Tr}\left({x}^{{2}^{d}}a\right)+\text{Tr}\left(x{a}^{{2}^{d}}\right)=\\ \text{Tr}\left(\right({x}^{{2}^{k-d}}+{x}^{{2}^{d-k}}+{x}^{{2}^{k}}+{x}^{{2}^{-k}}+{x}^{{2}^{d}}+{x}^{{2}^{-d}}\left)a\right)=\\ \text{Tr}\left(g\right(x\left)a\right)。\end{array} $$

    同理可得

    $$ \begin{array}{c}\text{Tr}({x}^{i-1}{a}^{{2}^{k}}+{x}^{{2}^{k}}{a}^{i-1}+{x}^{{2}^{k}}a+x{a}^{{2}^{k}}+{x}^{i-1}a+x{a}^{i-1})=\\ \text{Tr}\left(x\right({a}^{{2}^{k-d}}+{a}^{{2}^{d-k}}+{a}^{{2}^{k}}+{a}^{{2}^{-k}}+{a}^{{2}^{d}}+{a}^{{2}^{-d}}\left)\right)=\\ \text{Tr}\left(xg\right(a\left)\right)。\end{array} $$

    引理2.3  设$ n, \hspace{0.33em}k, \hspace{0.33em}i, \hspace{0.33em}m, \hspace{0.33em}d\in {\mathbb{N}}^{+} $,且$ n=2k+ 1 $,$ i=2m+1 $,$ m={2}^{d-1} $,$ \text{gcd}(n, d)=1 $,$ (k-d)|d $。设$ h\left(x\right)={x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i} $是$ \mathbb{F}_{{2}^{n}} $上的函数。则

    $$ {W}_{h}\left(u\right)=\left\{\begin{array}{l}0, 若\text{Tr}\left(u\right)=0, \\ \begin{array}{c}{(-1)}^{\text{Tr}({\sigma }^{{2}^{k+1+d}+{2}^{k+1}+1}+{\sigma }^{{2}^{k+1}+1}+{\sigma }^{{2}^{k+1-d}+{2}^{k+1}}+\delta \sigma )}{W}_{h}\left(\sigma \right), \\ 若\text{Tr}\left(u\right)=1, \end{array}\end{array}\right. $$

    式中,$ \sigma , \hspace{0.33em}\delta \in \mathbb{F}_{{2}^{n}} $,$ \text{Tr}\left(\delta \right)=1 $且$ g\left(\sigma \right)=u+\delta $。

    证明  设$ \sigma \in \mathbb{F}_{{2}^{n}} $,则根据定义1.3得

    $$ \begin{array}{c}{W}_{h}\left(u\right)=\\ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}({(x+\sigma )}^{{2}^{k}+i-1}+{(x+\sigma )}^{{2}^{k}+1}+{(x+\sigma )}^{i}+u(x+\sigma \left)\right)}=\\ \hspace{0.33em}{(-1)}^{\text{Tr}({\sigma }^{{2}^{k}+i-1}+{\sigma }^{{2}^{k}+1}+{\sigma }^{i}+u\sigma )}\cdot \\ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}({x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i}+x(g\left(\sigma \right)+u\left)\right)}。\end{array} $$ (5)

    显然,$ \text{Tr}\left(g\right(\sigma \left)\right)=0 $。若$ \text{Tr}\left(u\right)=0 $,可选一个$ \sigma $使得$ g\left(\sigma \right)=u $。则式(5)中的求和变为$ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}({x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i})}=0 $,即$ \mathcal{W}_{h}\left(u\right)=0 $。

    若$ \text{Tr}\left(u\right)=1 $,可选一个$ \sigma $使得$ g\left(\sigma \right)=u+\delta $,其中$ \text{Tr}\left(\delta \right)=1 $。则式(5)中的求和变为$ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}({x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i}+\delta x)}={W}_{h}\left(\delta \right) $,即

    $$ \begin{array}{c}\mathcal{W}_{h}\left(u\right)={(-1)}^{\text{Tr}({\sigma }^{{2}^{k}+i-1}+{\sigma }^{{2}^{k}+1}+{\sigma }^{i}+u\sigma )}{W}_{h}\left(\sigma \right)=\\ \hspace{1em}\hspace{1em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}{(-1)}^{\text{Tr}({\sigma }^{{2}^{k+1+d}+{2}^{k+1}+1}+{\sigma }^{{2}^{k+1}+1}+{\sigma }^{{2}^{k+1-d}+{2}^{k+1}}+\delta \sigma )}{W}_{h}\left(\delta \right)。\end{array} $$

    定理2.1  设$ n, \hspace{0.33em}k, \hspace{0.33em}i, \hspace{0.33em}m, \hspace{0.33em}d\in {\mathbb{N}}^{+} $,且$ n=2k+1 $,$ i=2m+1 $,$ m={2}^{d-1} $,$ \text{gcd}(n, d)=1 $,$ (k-d)|d $。则对于任意的$ a, b\in \mathbb{F}_{{2}^{n}}, c\in \mathbb{F}_{{2}^{n}}\backslash \left\{\mathrm{0, 1}\right\} $,$ H\left(x\right) $在$ (a, b) $处的c-差分分布表的值为

    $$ {}_{c}{\Delta }_{H}(a, b)={\left\{\begin{array}{l}0, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} 若A=1\hspace{0.33em}且\hspace{0.33em}B=1, \\ 1, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em}若B=0, \\ 2, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} 若A=0\hspace{0.33em}且\hspace{0.33em}B=1, \end{array}\right.}^{} $$

    即$ H\left(x\right) $是$ \mathbb{F}_{{2}^{n}} $上的APcN置换,式中,

    $$ A=\text{Tr}\left(\right(a+b\left)g\right(a){(1+c)}^{-1}+{a}^{{2}^{k}+i-1}+{a}^{{2}^{k}+1}+{a}^{i}+a) \text{,} $$
    $$ B=\text{Tr}\left(g\right(a\left){(1+c)}^{-1}\right) 。 $$

    证明  $ H\left(x\right) $在点$ (a, b) $处的值为下列方程的解$ x\in \mathbb{F}_{{p}^{n}} $的个数,其中$ a, b\in \mathbb{F}_{{2}^{n}} $。

    $$ \begin{array}{c}b=H(x+a)+cH\left(x\right)=\\ x+a+1+\text{Tr}({(x+a)}^{{2}^{k}+i-1}+{(x+a)}^{{2}^{k}+1}+\\  {(x+a)}^{i}+x+a)+\\ c(x+1+\text{Tr}({x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i}+x\left)\right)=\\ (c+1)(x+1+\text{Tr}({x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i}+x\left)\right)+\\ a+1+\text{Tr}({a}^{{2}^{k}+i-1}+{a}^{{2}^{k}+1}+{a}^{i}+a)+\text{Tr}({x}^{i-1}{a}^{{2}^{k}}+\\ {x}^{{2}^{k}}{a}^{i-1}+{x}^{{2}^{k}}a+x{a}^{{2}^{k}}+{x}^{i-1}a+x{a}^{i-1})+1=\\ (c+1)H\left(x\right)+H\left(a\right)+\text{Tr}\left(xg\right(a\left)\right)+1, \end{array} $$

    上式等价于

    $$ (c+1)H\left(x\right)+H\left(a\right)+\text{Tr}\left(xg\right(a\left)\right)+1+b=0。 $$ (6)

    根据引理1.2,方程(6)的解$ x\in \mathbb{F}_{{2}^{n}} $的个数为

    $$ \begin{array}{c}\hspace{0.33em}{\hspace{0.33em}}_{c}{\Delta }_{H}(a, b)=\\ \frac{1}{{2}^{n}}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}}\sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right((c+1)H\left(x\right)+H\left(a\right)+\text{Tr}\left(xg\right(a\left)\right)+1+b\left)\right)}=\end{array} $$
    $$ \begin{array}{c}\frac{1}{{2}^{n}}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(H\left(a\right)+1+b\left)\right)}\cdot \\ \hspace{0.33em}\sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(c+1\left)H\right(x\left)\right)+\text{Tr}\left(\beta \right)\text{Tr}\left(xg\right(a\left)\right)}=\\ \frac{1}{{2}^{n}}({C}_{0}+{C}_{1}), \end{array} $$

    式中$ {C}_{0} $与$ {C}_{1} $分别是$ \text{Tr}\left(\beta \right)=0 $与$ \text{Tr}\left(\beta \right)=1 $时的和。下面将分别计算$ {C}_{0} $和$ {C}_{1} $。

    $$ \begin{array}{c}{C}_{0}=\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=0}{(-1)}^{\text{Tr}\left(\beta \right(H\left(a\right)+1+b\left)\right)}·\\ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(1+c\left)H\right(x\left)\right)}=\\ {2}^{n}+\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}^{*}, \text{Tr}\left(\beta \right)=0}{(-1)}^{\text{Tr}\left(\beta \right(H\left(a\right)+1+b\left)\right)}·\\ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(1+c\left)H\right(x\left)\right)}={2}^{n}, \end{array} $$

    因为$ \beta (1+c)\ne 0 $且$ H\left(x\right) $是$ \mathbb{F}_{{2}^{n}} $上的对合,所以

    $$ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(1+c\left)H\right(x\left)\right)}=0 。 $$
    $$ \begin{array}{c}{C}_{1}=\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=1}{(-1)}^{\text{Tr}\left(\beta \right(H\left(a\right)+1+b\left)\right)}\cdot \\ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(c+1\left)H\right(x\left)\right)+\text{Tr}\left(xg\right(a\left)\right)}=\\ \sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=1}{(-1)}^{\text{Tr}\left(\beta \right(H\left(a\right)+1+b\left)\right)}\cdot \\ \hspace{0.33em}\hspace{0.33em}\sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(c+1\left)\right(x+1+\text{Tr}({x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i}+x)\left)\right)+\text{Tr}\left(xg\right(a\left)\right)}=\\ \sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=1}{(-1)}^{\text{Tr}\left(\beta \right(H\left(a\right)+b+c\left)\right)}\cdot \\  \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(c+1\left)\right)\text{Tr}({x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i}+x)+\text{Tr}\left(x\right(\beta (c+1)+g\left(a\right)\left)\right)}=\\ {C}_{\mathrm{1, 0}}+{C}_{\mathrm{1, 1}}, \end{array} $$

    式中$ {C}_{\mathrm{1, 0}} $与$ {C}_{\mathrm{1, 1}} $分别是$ \text{Tr}\left(\beta \right(c+1\left)\right)=0 $(即$ \text{Tr}\left(\beta c\right)=1 $)与$ \text{Tr}\left(\beta \right(c+1\left)\right)=1 $(即$ \text{Tr}\left(\beta c\right)=0 $)时的和。下面将分别计算$ {C}_{\mathrm{1, 0}} $和$ {C}_{\mathrm{1, 1}} $。

    $$ \begin{array}{c}{C}_{\mathrm{1, 0}}=\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=1=\text{Tr}\left(\beta c\right)}{(-1)}^{\text{Tr}\left(\beta \right(H\left(a\right)+b+c\left)\right)}\cdot \\ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(x\right(\beta (c+1)+g\left(a\right)\left)\right)}=\\ \sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=1=\text{Tr}\left(\beta c\right)}{(-1)}^{\text{Tr}\left(\beta \right(a+1+\text{Tr}({a}^{{2}^{k}+i-1}+{a}^{{2}^{k}+1}+{a}^{i}+a)+b+c\left)\right)}\cdot  \end{array} $$
    $$ \begin{array}{c}\sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(x\right(\beta (c+1)+g\left(a\right)\left)\right)}=\\ \hspace{0.33em}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=1=\text{Tr}\left(\beta c\right)}{(-1)}^{\text{Tr}\left(\beta \right(a+b)+{a}^{{2}^{k}+i-1}+{a}^{{2}^{k}+1}+{a}^{i}+a)}\cdot \\  \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(x\right(\beta (c+1)+g\left(a\right)\left)\right)}=\\ \left\{\begin{array}{l}0, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} \hspace{0.33em} \hspace{0.33em}若\hspace{0.33em}B=0, \\ {2}^{n}\cdot {(-1)}^{A}, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}\hspace{0.33em}  若\hspace{0.33em}B=1, \end{array}\right.\end{array} $$

    式中:$ A=\text{Tr}\left(\right(a+b\left)g\right(a){(1+c)}^{-1}+{a}^{{2}^{k}+i-1}+{a}^{{2}^{k}+1}+ $ $ {a}^{i} $ $ +a) $;$ B=\text{Tr}\left(g\right(a\left){(1+c)}^{-1}\right) $,最后1个等号成立当且仅当$ \beta (c+1)={g}_{1}\left(a\right) $。

    $$ \begin{array}{c}{C}_{\mathrm{1, 1}}=\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=1, \text{Tr}\left(\beta c\right)=0}{(-1)}^{\text{Tr}\left(\beta \right(H\left(a\right)+b\left)\right)}\cdot \\ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}({x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i}+x(\beta (c+1)+g\left(a\right)\left)\right)}=\\ \sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=1, \text{Tr}\left(\beta c\right)=0}{(-1)}^{\text{Tr}\left(\beta \right(H\left(a\right)+b\left)\right)}\mathcal{W}_{h}\left(u\right), \end{array} $$

    式中$ \mathcal{W}_{h}\left(u\right) $见定义1.3,$ u=1+\beta (c+1)+g\left(a\right) $,且$ h\left(x\right)=\text{Tr}({x}^{{2}^{k}+i-1}+{x}^{{2}^{k}+1}+{x}^{i}) $是$ \mathbb{F}_{{2}^{n}} $上的函数。显然,$ \text{Tr}\left(u\right)=\text{Tr}(1+\beta (c+1)+g(a\left)\right)=0 $,由引理2.3可得$ {C}_{\mathrm{1, 1}}=0 $。

    综上所述,对于$ c\in \mathbb{F}_{{2}^{n}}\backslash \left\{\mathrm{0, 1}\right\} $,方程(6)的解$ x\in \mathbb{F}_{{2}^{n}} $的个数为

    $$ {}_{c}{\Delta }_{H}(a, b)=\left\{\begin{array}{l}0, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} 若A=1\hspace{0.33em}且\hspace{0.33em}B=1, \\ 1, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em}若B=0, \\ 2, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} 若A=0\hspace{0.33em}且\hspace{0.33em}B=1, \end{array}\right. $$

    即$ H\left(x\right) $是$ \mathbb{F}_{{2}^{n}} $上的APcN置换,式中:$ A=\text{Tr}\left(\right(a+b\left)g\right(a){(1+c)}^{-1}+{a}^{{2}^{k}+i-1}+{a}^{{2}^{k}+1}+{a}^{i}+a) $,$ B=\text{Tr}\left(g\right(a\left){(1+c)}^{-1}\right) $。

    本节进一步研究了$ H\left(x\right) $的回旋镖均匀度。下面先给出一个有用的引理。

    引理3.1  设$ n, \hspace{0.33em}k, \hspace{0.33em}i, \hspace{0.33em}m, \hspace{0.33em}d\in {\mathbb{N}}^{+} $,且$ n=2k+1 $,$ i=2m+1 $,$ m={2}^{d-1} $,$ \text{gcd}(n, d)=1 $,$ (k-d)|d $。设$ g\left(x\right) $是引理2.2中的多项式,则$ g\left(x\right)=0 $在$ \mathbb{F}_{{2}^{n}} $中仅有2个解$ x=\mathrm{0, 1} $。

    证明  由于$ n= 2k+1 $,则$ \text{gcd}(n, \hspace{0.33em}k)= $ $ \text{gcd}\left(2\right.k+1, \hspace{0.33em}k) = 1 $。又因为$ \text{gcd}(n, d)=1 $,且$ (k-d)|d $,则$ \text{gcd}(n, d)=\text{gcd}(n, k-d)=1 $。

    对等式$ g\left(x\right)=0 $两边同时取$ {2}^{k} $次幂可得

    $$ {x}^{{2}^{2k-d}}+{x}^{{2}^{d}}+{x}^{{2}^{2k}}+x+{x}^{{2}^{k+d}}+{x}^{{2}^{k-d}}=0。 $$

    设$ g\text{'}\left(x\right)={x}^{{2}^{2k-d}}+{x}^{{2}^{d}}+{x}^{{2}^{2k}}+x+{x}^{{2}^{k+d}}+{x}^{{2}^{k-d}} $,由定义1.5可知,$ g\text{'}\left(x\right) $的常规2-关联多项式为

    $$ G\left(x\right)={x}^{2k}+{x}^{2k-d}+{x}^{k+d}+{x}^{k-d}+{x}^{d}+1 \text{,} $$

    且$ \text{gcd}\left(g\text{'}\right(x), {x}^{{2}^{n}}+x) $是$ \text{gcd}\left(G\right(x), {x}^{n}+1) $的线性化关联。又因为$ G\left(x\right)=({x}^{k}+1)({x}^{k-d}+1)({x}^{d}+1) $且$ \text{gcd}(n, k)=\text{gcd}(n, k-d)=\text{gcd}(n, d)=1 $,容易得到$ \text{gcd}\left(G\right(x), {x}^{n}+1)=x+1 $。因此,$ g\left(x\right)=0 $在$ \mathbb{F}_{{2}^{n}} $中仅有2个解为$ x=\mathrm{0, 1} $。

    定理3.1  设$ n, \hspace{0.33em}k, \hspace{0.33em}i, \hspace{0.33em}m, \hspace{0.33em}d\in \mathbb{Z}\mathbb{*} $,且$ n=2k+1 $,$ i=2m+1 $,$ m={2}^{d-1} $,$ \text{gcd}(n, d)=1 $,$ (k-d)|d $。则$ H\left(x\right) $在点$ (a, b)\in \mathbb{F}_{{2}^{n}}^{*}\times \mathbb{F}_{{2}^{n}}^{*} $处BCT的值为

    $$ \mathcal{B}_H(a, b)=\left\{\begin{array}{l}{2}^{n}, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} 若\hspace{0.33em}\text{Tr}\left(g\right(a\left)b\right)=0, \\ 0, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} \hspace{0.33em}若\hspace{0.33em}\text{Tr}\left(g\right(a\left)b\right)=1, \end{array}\right. $$

    式中$ g\left(a\right)={a}^{{2}^{k-d}}+{a}^{{2}^{d-k}}+{a}^{{2}^{k}}+{a}^{{2}^{-k}}+{a}^{{2}^{d}}+{a}^{{2}^{-d}} $。

    证明  由于$ H\left(x\right) $在$ (a, b) $处的BCT的值等价于满足方程组(1)的解$ (x, y)\in \mathbb{F}_{{2}^{n}}^{}\times \mathbb{F}_{{2}^{n}}^{} $的数量,将$ H\left(x\right)=x+\text{Tr}({x}^{{2}^{k}+i}+{(x+1)}^{{2}^{k}+i}) $带入方程组(1)得

    $$ \left\{\begin{array}{l}x+y+\text{Tr}({x}^{{2}^{k}+i-1}+{y}^{{2}^{k}+i-1})+\text{Tr}({x}^{{2}^{k}+1}+{y}^{{2}^{k}+1})+\\ \hspace{0.33em}\hspace{0.33em} \text{Tr}({x}^{i}+{y}^{i})+\text{Tr}(x+y)=b, \\ x+y+\text{Tr}({(x+a)}^{{2}^{k}+i-1}+{(y+a)}^{{2}^{k}+i-1})+\\ \hspace{0.33em}\hspace{0.33em} \text{Tr}({(x+a)}^{{2}^{k}+1}+{(y+a)}^{{2}^{k}+1})+\text{Tr}(x+y)+\\ \hspace{0.33em}\hspace{0.33em}\text{Tr}({(x+a)}^{i}+{(y+a)}^{i})=b。\end{array}\right. $$ (7)

    简化方程组(7)中第1个等式可得

    $$ \begin{array}{c}b=x+y+\text{Tr}({x}^{{2}^{k}+i-1}+{y}^{{2}^{k}+i-1})+\\ \hspace{1em}\hspace{0.33em}\text{Tr}({x}^{{2}^{k}+1}+{y}^{{2}^{k}+1})+\text{Tr}({x}^{i}+{y}^{i})+\text{Tr}(x+y)=\\ x+y+\text{Tr}{(x+y)}^{{2}^{k}+i-1}+\text{Tr}{(x+y)}^{{2}^{k}+1}+\\ \text{Tr}{(x+y)}^{i}+\text{Tr}(x+y)+\\ \text{Tr}({x}^{{2}^{k}}{y}^{i-1}+{x}^{i-1}{y}^{{2}^{k}}+{x}^{{2}^{k}}y+x{y}^{{2}^{k}}+{x}^{i-1}y+x{y}^{i-1})=\\ H(x+y)+\text{Tr}({x}^{{2}^{k}}{y}^{i-1}+{x}^{i-1}{y}^{{2}^{k}}+{x}^{{2}^{k}}y+x{y}^{{2}^{k}}+\\ {x}^{i-1}y+x{y}^{i-1})+1。\end{array} $$

    将方程组(7)中的2式相加可得

    $$ \left\{\begin{array}{l}\text{Tr}({x}^{{2}^{k}}{y}^{i-1}+{x}^{i-1}{y}^{{2}^{k}}+{x}^{{2}^{k}}y+x{y}^{{2}^{k}}+{x}^{i-1}y+x{y}^{i-1})+\\ \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} H(x+y)+1=b, \\ \text{Tr}({(x+y)}^{{2}^{k}}{a}^{i-1}+{(x+y)}^{i-1}{a}^{{2}^{k}}+{(x+y)}^{{2}^{k}}a+\\ \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} (x+y){a}^{{2}^{k}}+{(x+y)}^{i-1}a+(x+y){a}^{i-1})=0。\end{array}\right. $$

    令$ x+y=z\in \mathbb{F}_{{2}^{n}} $,上述方程组变为

    $$ \left\{\begin{array}{l}H\left(z\right)+\text{Tr}({x}^{{2}^{k}}{z}^{i-1}+{x}^{i-1}{z}^{{2}^{k}}+{x}^{{2}^{k}}z+x{z}^{{2}^{k}}+\\ \hspace{0.33em}\hspace{0.33em}\hspace{0.33em}{x}^{i-1}z+x{z}^{i-1})+1=b, \\ \text{Tr}({z}^{{2}^{k}}{a}^{i-1}+{z}^{i-1}{a}^{{2}^{k}}+{z}^{{2}^{k}}a+z{a}^{{2}^{k}}+{z}^{i-1}a+z{a}^{i-1})=0。\end{array}\right. $$

    即

    $$ \left\{\begin{array}{l}H\left(z\right)+\text{Tr}\left(xg\right(z\left)\right)+1=b, \\ \text{Tr}\left(g\right(z\left)a\right)=0。\end{array}\right. $$ (8)

    根据引理1.3,方程组(8)的解$ (x, y)\in \mathbb{F}_{{2}^{n}}^{}\times \mathbb{F}_{{2}^{n}}^{} $的个数为

    $$ \begin{array}{c}\hspace{0.33em}\hspace{0.33em}\mathcal{B}_H(a, b)=\\ \frac{1}{{2}^{2n}}\sum\limits_{x, z\in \mathbb{F}_{{2}^{n}}}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(1+H\left(z\right)+\text{Tr}\left(xg\right(z\left)\right)+b\left)\right)}\cdot \\  \sum\limits_{\gamma \in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\gamma \text{Tr}\right(ag\left(z\right)\left)\right)}=\\ \frac{1}{{2}^{2n}}\sum\limits_{x, z\in \mathbb{F}_{{2}^{n}}}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right)+\text{Tr}\left(\beta H\right(z\left)\right)+\text{Tr}\left(\beta \right)\text{Tr}\left(xg\right(z\left)\right)+\text{Tr}\left(\beta b\right)}\cdot \\  \sum\limits_{\gamma \in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\gamma \right)\text{Tr}\left(g\right(z\left)a\right)}=\\ \frac{1}{{2}^{2n}}\sum\limits_{\gamma , \beta \in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(1+b\left)\right)}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)+\text{Tr}\left(\gamma \right)\text{Tr}\left(g\right(z\left)a\right)}\cdot \\  \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right)\text{Tr}\left(xg\right(z\left)\right)}=\\ \frac{1}{{2}^{2n}}({D}_{0}+{D}_{1}), \end{array} $$ (9)

    式中$ {D}_{0} $与$ {D}_{1} $分别是$ \text{Tr}\left(\beta \right)=0 $与$ \text{Tr}\left(\beta \right)=1 $时的和。下面将分别计算$ {D}_{0} $和$ {D}_{1} $。

    $$ \begin{array}{c}{D}_{0}=\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=0}{(-1)}^{\text{Tr}\left(\beta b\right)}\sum\limits_{\gamma \in \mathbb{F}_{{2}^{n}}}\cdot \\ \sum\limits_{x, z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)+\text{Tr}\left(\gamma \right)\text{Tr}\left(g\right(z\left)a\right)}=\\ {2}^{n}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=0}{(-1)}^{\text{Tr}\left(\beta b\right)}\sum\limits_{\gamma \in \mathbb{F}_{{2}^{n}}}\cdot \\ \sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)+\text{Tr}\left(\gamma \right)\text{Tr}\left(g\right(z\left)a\right)}=\\ {2}^{n}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=0}{(-1)}^{\text{Tr}\left(\beta b\right)}({D}_{\mathrm{0, 0}}+{D}_{\mathrm{0, 1}}), \end{array} $$ (10)

    式中$ {D}_{\mathrm{0, 0}} $与$ {D}_{\mathrm{0, 1}} $分别是$ \text{Tr}\left(\gamma \right)=0 $与$ \text{Tr}\left(\gamma \right)=1 $时的和。下面将分别计算$ {D}_{\mathrm{0, 0}} $和$ {D}_{\mathrm{0, 1}} $。

    $$ \begin{array}{c}{D}_{\mathrm{0, 0}}=\sum\limits_{\gamma \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\gamma \right)=0}{(-1)}^{\text{Tr}\left(\beta b\right)}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)}=\\ {2}^{n-1}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)}。\end{array} $$

    同理可得

    $$ \begin{array}{c}{D}_{\mathrm{0, 1}}=\sum\limits_{\gamma \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\gamma \right)=1}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)+\text{Tr}\left(g\right(z\left)a\right)}=\\ {2}^{n-1}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta \right(z+1+\text{Tr}({z}^{{2}^{k}+i-1}+{z}^{{2}^{k}+1}+{z}^{i}+z)\left)\right)+\text{Tr}\left(g\right(z\left)a\right)}=\\ {2}^{n-1}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(z\right(\beta +g\left(a\right)\left)\right)}。\end{array} $$

    将$ {D}_{\mathrm{0, 0}} $和$ {D}_{\mathrm{0, 1}} $的值代入式(10)得

    $$ \begin{array}{c}{D}_{0}={2}^{n}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=0}{(-1)}^{\text{Tr}\left(\beta b\right)}({2}^{n-1}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)}+\\ {2}^{n-1}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(z\right(\beta +g\left(a\right)\left)\right)})=\\ {2}^{2n-1}({2}^{n}+\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}^{*}, \text{Tr}\left(\beta \right)=0}{(-1)}^{\text{Tr}\left(\beta b\right)}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)}+\\ \sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=0}{(-1)}^{\text{Tr}\left(\beta b\right)}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(z\right(\beta +g\left(a\right)\left)\right)})=\\ {2}^{3n-1}+{2}^{2n-1}\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=0}{(-1)}^{\text{Tr}\left(\beta b\right)}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(z\right(\beta +g\left(a\right)\left)\right)}=\\ {2}^{3n-1}+{2}^{2n-1}{(-1)}^{\text{Tr}\left(g\right(a\left)b\right)}, \end{array} $$

    其中,由于$ \beta \ne 0 $且$ H\left(z\right) $是$ \mathbb{F}_{{2}^{n}} $上的对合,则$ \sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)}=0 $。最后一个等号成立当且仅当$ \beta =g\left(a\right) $。

    $$ \begin{array}{c}{D}_{1}=\sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=1}{(-1)}^{\text{Tr}\left(\beta b\right)}\sum\limits_{\gamma \in \mathbb{F}_{{2}^{n}}}·\\ \sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)+\text{Tr}\left(\gamma \right)\text{Tr}\left(g\right(z\left)a\right)} \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(xg\right(z\left)\right)}=\\ \sum\limits_{\beta \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\beta \right)=1}{(-1)}^{\text{Tr}\left(\beta b\right)}({D}_{\mathrm{1, 0}}+{D}_{\mathrm{1, 1}}), \end{array} $$ (11)

    式中$ {D}_{\mathrm{1, 0}} $和$ {D}_{\mathrm{1, 1}} $分别是$ \text{Tr}\left(\gamma \right)=0 $和$ \text{Tr}\left(\gamma \right)=1 $时的和。下面将分别计算$ {D}_{\mathrm{1, 0}} $和$ {D}_{\mathrm{1, 1}} $。

    $$ \begin{array}{c}{D}_{\mathrm{1, 0}}=\sum\limits_{\gamma \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(\gamma \right)=0}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)}\sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(xg\right(z\left)\right)}=\\ {2}^{n-1}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)}\sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(xg\right(z\left)\right)}=\\ {2}^{n-1}({2}^{n}{(-1)}^{\text{Tr}\left(\beta H\right(0\left)\right)}+{2}^{n}{(-1)}^{\text{Tr}\left(\beta H\right(1\left)\right)}+\\ \sum\limits_{z\in \mathbb{F}_{{2}^{n}}\backslash \left\{\mathrm{0, 1}\right\}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)}\sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(xg\right(z\left)\right)})=\\ {2}^{2n-1}({(-1)}^{\text{Tr}\left(\beta \right)}+1)=0, \end{array} $$

    式中:$ H\left(0\right)=1 $,$ H\left(1\right)=0 $,且由引理3.1得$ g\left(z\right)\ne 0 $对于$ z\in \mathbb{F}_{{2}^{n}}\backslash \left\{\mathrm{0, 1}\right\} $。

    $$ \begin{array}{c}{D}_{\mathrm{1, 1}}=\sum\limits_{\gamma \in \mathbb{F}_{{2}^{n}}, \text{Tr}\left(r\right)=1}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)+\text{Tr}\left(g\right(z\left)a\right)}·\\ \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(xg\right(z\left)\right)}=\\ {2}^{n-1}\sum\limits_{z\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)+\text{Tr}\left(g\right(z\left)a\right)}\sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(xg\right(z\left)\right)}=\\ {2}^{n-1}({2}^{n}{(-1)}^{\text{Tr}\left(\beta H\right(0\left)\right)}+{2}^{n}{(-1)}^{\text{Tr}\left(\beta H\right(1\left)\right)}+\\ \sum\limits_{z\in \mathbb{F}_{{2}^{n}}\backslash \left\{\mathrm{0, 1}\right\}}{(-1)}^{\text{Tr}\left(\beta H\right(z\left)\right)+\text{Tr}\left(g\right(z\left)a\right)}\cdot \sum\limits_{x\in \mathbb{F}_{{2}^{n}}}{(-1)}^{\text{Tr}\left(xg\right(z\left)\right)})=\\ {2}^{2n-1}({(-1)}^{\text{Tr}\left(\beta \right)}+1)=0。\end{array} $$

    显然,将$ {D}_{\mathrm{1, 0}} $和$ {D}_{\mathrm{1, 1}} $的值代入式(11)得$ {D}_{1}=0 $。再将$ {D}_{0} $和$ {D}_{1} $的值代入式(9)得

    $$ \begin{array}{c}\mathcal{B}_H(a, b)={2}^{n-1}+{2}^{n-1}{(-1)}^{\text{Tr}\left(g\right(a\left)b\right)}\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{0.33em}=\left\{\begin{array}{l}{2}^{n}, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} 若\hspace{0.33em}\text{Tr}\left(g\right(a\left)b\right)=0, \\ 0, \hspace{0.33em}\hspace{0.33em}\hspace{0.33em} \hspace{0.33em}若\hspace{0.33em}\text{Tr}\left(g\right(a\left)b\right)=1。\end{array}\right.\end{array} $$

    本文首先利用迹函数构造了一类$ \mathbb{F}_{{2}^{n}} $上的非单项函数$ H\left(x\right)=x+\text{Tr}({x}^{{2}^{k}+i}+{(x+1)}^{{2}^{k}+i}) $。接着,研究了$ H\left(x\right) $的c-差分均匀度及回旋镖均匀度,并确定$ H\left(x\right) $是$ \mathbb{F}_{{2}^{n}} $上的APcN置换且该函数具有低回旋镖均匀度,能够较好的抵抗差分攻击以及回旋镖攻击。需要指出的是,到目前为止,寻找多种密码学指标良好的向量布尔函数仍是学者们关注的热点。

  • 表  1   $ \mathbb{F}_{p^n}$上常见的$ F(x)=x^d$型PcN幂函数

    $p$ $d$ 条件 参考文献
    任意 2 $c=0$ [12]
    2 $\left(3^k+1\right) / 2$ $c=-1, \frac{n}{\operatorname{gcd}(k, m)}=1$ [12]
    奇数 $\left(p^2+1\right) / 2$ $c=-1, m$是奇数 [13]
    奇数 $p^2-p+1$ $c=-1, m=3$ [13]
    奇数 $p^4+(p-2) p^2+(p-1)+1$ $c=-1, m=5$ [14]
    奇数 $\left(p^5+1\right) /(p+1)$ $c=-1, m=5$ [14]
    奇数 $(p-1) p^6+p^5+(p-2) p^3+(p-1) p^2+p$ $c=-1, m=7$ [14]
    奇数 $(p-1) p^6+(p-2) p^5+(p-1) p^4+p^3+p^2+p$ $c=-1, m=7$ [14]
    奇数 $\left(p^7+1\right) /(p+1)$ $c=-1, m=7$ [14]
    奇数 $\left(p^k+1\right) / 2$ $v_2(m) \leqslant v_2(k)+1, c=-1$ [15]
    2 $2^k+1$ $v_2(m) \leqslant v_2(k)+1, c \in \mathbb{F}_{2^{\operatorname{gcd}(m, k)}}$ [18]
    3 $\frac{3^k+1}{2} d \equiv \frac{3^m+1}{2}\left(\text{ mod } 3^m-1\right), d$是奇数 $k, m$是奇数,$\operatorname{gcd}(m, k)=1$ [17]
    5 $\frac{5^k+1}{2} d \equiv \frac{5^m+1}{2}\left(\text{ mod } 5^m-1\right), d$是奇数 $k, m$是正整数,$\operatorname{gcd}(2 m, k)=1$ [16]

    表  2   $ \mathbb{F}_{p^n}$上常见的$ F(x)=x^d$型APcN幂函数

    $p$ $d$ 条件 参考文献
    任意 2 $c \neq 1$ [12]
    2 $2^m-2$ $\operatorname{Tr}_1^m(c)=\operatorname{Tr}_1^m\left(c^{-1}\right)=1$ [12]
    奇数 $p^m-2$ $c=4, 4-1$或$\chi\left(c^2-4 c\right)=\chi(1-4 c)=-1$ [12]
    3 $\frac{3^n+3}{2}$ $c=-1, m$是偶数 [15]
    3 $3^n-3$ $c=0$ [15]
    奇数 $p^k+1$ $v_2(m) \leqslant v_2(k)+1, c \in \mathbb{F}_{p^{\operatorname{gcd}(m, k)}}$ [15]
    3 $\frac{3^k+1}{2}$ k是奇数,c = −1
    gcd(k,m)=1
    [16]
    2 $2^{3 n}+2^{2 n}+2^n-1$ $c \in \mathbb{F}_{2^{4 n}} \backslash\{1\}, c^{2^{2 n}+1}=1$ [19]
  • [1] SHELDON B, AKERS J. On a theory of Boolean functions[J]. Journal of the Society for Industrial and Applied Mathematics, 1959, 7(4): 487-498. doi: 10.1137/0107041
    [2] BIHAM E, SHAMIR A. Differential cryptanalysis of DES-like cryptosystems[J]. Journal of Cryptology, 1991, 4(1): 3-72. doi: 10.1007/BF00630563
    [3] NYBERG K. Differentially uniform mappings for cryptography[J]. Proc of Eurocrypt, 1993, 4357(3): 150-164.
    [4] BETH T, DING C S. On almost perfect nonlinear permutations[C]//STINSON D R. Workshop on the theory and application of cryptographic techniques. Berlin: Springer, 1993: 65-76.
    [5] CARLET C, KIM K, MESNAGER S. A direct proof of APN-ness of the Kasami functions[J]. Designs, Codes and Cryptography, 2021, 89: 441-446. doi: 10.1007/s10623-020-00830-y
    [6] DOBBERTIN H. Almost perfect nonlinear power functions on GF(2n): the Niho case[J]. IEEE Transactions on Information Theory, 1999, 45(4): 1271-1275. doi: 10.1109/18.761283
    [7] 屈龙江, 陈玺, 牛泰霖, 等. 有限域上低差分函数研究进展[J]. 计算机研究与发展, 2018, 55(9): 1931-1945.
    [8] 王彦平. 低差分置换函数的研究[D]. 西安: 西安电子科技大学, 2022.
    [9] CALDERINI M, BUDAGHYAN L, CARLET C. On known constructions of APN and AB functions and their relation to each other[J]. Rad Hrvatske akademije znanosti i umjetnosti: Matematičke znanosti, 2021, 546(25): 79-105.
    [10] PANARIO D, SAKZAD A, STEVENS B. et al. Ambiguity and deficiency of ermutations from finite fields[C]//POOR H V, ULUKUS S. 2011 IEEE Information Theory Workshop. New York: IEEE, 2011: 165-169.
    [11] BORISOV N, CHEW M, JOHNSON R, et al. Multiplicative differentials[C]//DAEMEN J, RIJMEN V. Fast software encryption-FSE 2002. Berlin: Springer, 2002: 17-33.
    [12] ELLINGSEN P, FELKE P, RIERA C. et al. C-differentials, multiplicative uniformity, and (almost) perfect c-nonlinearity[J]. IEEE Transactions on Information Theory, 2020, 66(9): 5781-5789. doi: 10.1109/TIT.2020.2971988
    [13] BARTOLI D, TIMPANELLA M. On a generalization of planar functions[J]. Journal of Algebraic Combinatorics, 2020(52): 187-213.
    [14] MESNAGER S, RIERA C, STĂNICĂ P. et al. Investigations on c-(almost) perfect nonlinear functions[J]. IEEE Transactions on Information Theory, 2021, 67(10): 6916-6925. doi: 10.1109/TIT.2021.3081348
    [15] HASAN S U, PAL M, RIERA C. et al. On the c-differential uniformity of certain maps over finite fields[J]. Designs, Codes and Cryptography, 2021, 89(2): 221-239. doi: 10.1007/s10623-020-00812-0
    [16] YAN H D, MESNAGER S, ZHOU Z C. Power functions over finite fields with low c-differential uniformity[EB/OL]. [2023-09-01]. https://arxiv.org/abs/2003.13019.
    [17] ZHA Z, HU L. Some classes of power functions with low c-differential uniformity over finite fields[J]. Designs, Codes and Cryptography, 2021, 89: 1193-1210. doi: 10.1007/s10623-021-00866-8
    [18] WANG X Q, ZHENG D B, LEI H B. Several classes of PcN power functions over finite fields[J]. Discrete Applied Mathematics, 2022(322): 171-182.
    [19] TU Z R, LI N, WU Y N, et al. On the differential spectrum and the APcN property of a class of power functions over finite fields[J]. IEEE Transactions on Information Theory, 2022, 69(1): 582-597.
    [20] WU Y N, LI N, ZENG X Y. New PcN and APcN functions over finite fields[J]. Designs, Codes and Cryptography, 2021(89): 2637-2651.
    [21] BARTOLI D, CALDERINI M. On construction and (non) existence of c-(almost) perfect nonlinear functions[J]. Finite Fields and Their Applications, 2021, 72(1): 1-16.
    [22] STĂNICĂ P. Low c-differential and c-boomerang uniformity of the swapped inverse function[J]. Discrete Mathematics, 2021, 344(10): 1-13.
    [23] WAGNER D. The boomerang attack[C]//KNUDSEN L R, CANNIERE C D. International workshop on fast software encryption. Berlin: Springer, 1999: 156-170.
    [24] CID C, HUANG T, PEYRIN T, et al. Boomerang connectivity table: a new ryptanalysis tool[C]//NIELSEN J B, RIJMEN V. Advances in Cryptology-EUROCRYPT 2018: 37th Annual international conference on the theory and applications of cryptographic techniques. Cham: Springer, 2018: 683-714.
    [25] BOURA C, CANTEAUT A. On the boomerang uniformity of cryptographic Sboxes[J]. IACR Transactions on Symmetric Cryptology, 2018, 2018(3): 290-310.
    [26] LI K Q, QU L J, SUN B. et al. New results about the boomerang uniformity of permutation polynomials[J]. IEEE Transactions on Information Theory, 2019, 65(11): 7542-7553. doi: 10.1109/TIT.2019.2918531
    [27] CALDERINI M, VILLA I. On the boomerang uniformity of some permutation polynomials[J]. Cryptography and Communications, 2020, 12(6): 1161-1178. doi: 10.1007/s12095-020-00439-x
    [28] HASAN S U, PAL M, STĂNICĂ P. The c-differential uniformity and boomerang uniformity of two classes of permutation polynomials[J]. IEEE Transactions on Information Theory, 2021, 68(1): 679-691.
    [29] STĂNICĂ P. Using double Weil sums in finding the c-boomerang connectivity table for monomial functions on finite fields[J]. Applicable Algebra in Engineering, Communication and Computing, 2023, 34(4): 581-602. doi: 10.1007/s00200-021-00520-9
    [30] LIDL R, NIEDERREITER H. Finite fields[M]. Cambridge: Cambridge University Press, 1997.
    [31] CARLET C. Boolean functions for cryptography and error correcting codes[M]. Cambridge: Cambridge University Press, 2010.
WeChat 点击查看大图
表(2)
出版历程
  • 收稿日期:  2023-09-12

目录

    /

    返回文章
    返回