论有限域上几类幂函数的二阶零微分性质

Huan Zhou, Xiaoni Du, Xingbin Qiao, Wenping Yuan
{"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}
引用次数: 0

摘要

费斯特回旋镖连接表(FBCT)是一种重要的密码分析技术,用于分析基于费斯特网络的密码对微分攻击和回旋镖攻击等权力攻击的抵抗能力。此外,FBCT的系数与偶特征有限域上函数$F(x)$的二阶零微分谱密切相关,而Feistel回旋镖均匀性就是$F(x)$的二阶零微分均匀性。本文通过计算有限域上特定方程的解的数目,明确地确定了偶特征有限域上的幂函数$x^{2^m+3}$和$x^{2^m+5}$(其中$m>2$为正整数)以及奇特征有限域上的幂函数$x^{p^k+1}$(其中$k\geq1$为整数)的二阶零微分谱。值得注意的是,$x^{2^m+3}$ 是$m$上的一个置换,只有当 $m$ 是奇数时才是,$x^{2^m+5}$ 是$n=2m$ 的整数$mathbb{F}_{2^n}$ 上的一个置换。作为副产品,我们发现$F(x)=x^4$是奇$n$上的一个PN和二阶零微分$0$匀函数。计算这些条目和每个表中的cardinality旨在方便在研究区分器和追踪时分析S-盒的差分和回旋镖密码分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信