{"title":"论有限域上几类幂函数的二阶零微分性质","authors":"Huan Zhou, Xiaoni Du, Xingbin Qiao, Wenping Yuan","doi":"arxiv-2409.11693","DOIUrl":null,"url":null,"abstract":"Feistel Boomerang Connectivity Table (FBCT) is an important cryptanalytic\ntechnique on analysing the resistance of the Feistel network-based ciphers to\npower attacks such as differential and boomerang attacks. Moreover, the\ncoefficients of FBCT are closely related to the second-order zero differential\nspectra of the function $F(x)$ over the finite fields with even characteristic\nand the Feistel boomerang uniformity is the second-order zero differential\nuniformity of $F(x)$. In this paper, by computing the number of solutions of\nspecific equations over finite fields, we determine explicitly the second-order\nzero differential spectra of power functions $x^{2^m+3}$ and $x^{2^m+5}$ with\n$m>2$ being a positive integer over finite field with even characteristic, and\n$x^{p^k+1}$ with integer $k\\geq1$ over finite field with odd characteristic\n$p$. It is worth noting that $x^{2^m+3}$ is a permutation over\n$\\mathbb{F}_{2^n}$ and only when $m$ is odd, $x^{2^m+5}$ is a permutation over\n$\\mathbb{F}_{2^n}$, where integer $n=2m$. As a byproduct, we find $F(x)=x^4$ is\na PN and second-order zero differentially $0$-uniform function over\n$\\mathbb{F}_{3^n}$ with odd $n$. The computation of these entries and the\ncardinalities in each table aimed to facilitate the analysis of differential\nand boomerang cryptanalysis of S-boxes when studying distinguishers and trails.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"59 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the second-order zero differential properties of several classes of power functions over finite fields\",\"authors\":\"Huan Zhou, Xiaoni Du, Xingbin Qiao, Wenping Yuan\",\"doi\":\"arxiv-2409.11693\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Feistel Boomerang Connectivity Table (FBCT) is an important cryptanalytic\\ntechnique on analysing the resistance of the Feistel network-based ciphers to\\npower attacks such as differential and boomerang attacks. Moreover, the\\ncoefficients of FBCT are closely related to the second-order zero differential\\nspectra of the function $F(x)$ over the finite fields with even characteristic\\nand the Feistel boomerang uniformity is the second-order zero differential\\nuniformity of $F(x)$. In this paper, by computing the number of solutions of\\nspecific equations over finite fields, we determine explicitly the second-order\\nzero differential spectra of power functions $x^{2^m+3}$ and $x^{2^m+5}$ with\\n$m>2$ being a positive integer over finite field with even characteristic, and\\n$x^{p^k+1}$ with integer $k\\\\geq1$ over finite field with odd characteristic\\n$p$. It is worth noting that $x^{2^m+3}$ is a permutation over\\n$\\\\mathbb{F}_{2^n}$ and only when $m$ is odd, $x^{2^m+5}$ is a permutation over\\n$\\\\mathbb{F}_{2^n}$, where integer $n=2m$. As a byproduct, we find $F(x)=x^4$ is\\na PN and second-order zero differentially $0$-uniform function over\\n$\\\\mathbb{F}_{3^n}$ with odd $n$. The computation of these entries and the\\ncardinalities in each table aimed to facilitate the analysis of differential\\nand boomerang cryptanalysis of S-boxes when studying distinguishers and trails.\",\"PeriodicalId\":501082,\"journal\":{\"name\":\"arXiv - MATH - Information Theory\",\"volume\":\"59 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.11693\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11693","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the second-order zero differential properties of several classes of power functions over finite fields
Feistel Boomerang Connectivity Table (FBCT) is an important cryptanalytic
technique on analysing the resistance of the Feistel network-based ciphers to
power attacks such as differential and boomerang attacks. Moreover, the
coefficients of FBCT are closely related to the second-order zero differential
spectra of the function $F(x)$ over the finite fields with even characteristic
and the Feistel boomerang uniformity is the second-order zero differential
uniformity of $F(x)$. In this paper, by computing the number of solutions of
specific equations over finite fields, we determine explicitly the second-order
zero differential spectra of power functions $x^{2^m+3}$ and $x^{2^m+5}$ with
$m>2$ being a positive integer over finite field with even characteristic, and
$x^{p^k+1}$ with integer $k\geq1$ over finite field with odd characteristic
$p$. It is worth noting that $x^{2^m+3}$ is a permutation over
$\mathbb{F}_{2^n}$ and only when $m$ is odd, $x^{2^m+5}$ is a permutation over
$\mathbb{F}_{2^n}$, where integer $n=2m$. As a byproduct, we find $F(x)=x^4$ is
a PN and second-order zero differentially $0$-uniform function over
$\mathbb{F}_{3^n}$ with odd $n$. The computation of these entries and the
cardinalities in each table aimed to facilitate the analysis of differential
and boomerang cryptanalysis of S-boxes when studying distinguishers and trails.