Yongbo Xia, Chunlei Li, Furong Bao, Shaoping Chen, Tor Helleseth
{"title":"广义奈斯-赫勒塞斯函数微分性质的进一步研究","authors":"Yongbo Xia, Chunlei Li, Furong Bao, Shaoping Chen, Tor Helleseth","doi":"10.1007/s10623-024-01525-4","DOIUrl":null,"url":null,"abstract":"<p>Let <i>n</i> be an odd positive integer, <i>p</i> be an odd prime with <span>\\(p\\equiv 3\\pmod 4\\)</span>, <span>\\(d_{1} = {{p^{n}-1}\\over {2}} -1 \\)</span> and <span>\\(d_{2} =p^{n}-2\\)</span>. The function defined by <span>\\(f_u(x)=ux^{d_{1}}+x^{d_{2}}\\)</span> is called the generalized Ness–Helleseth function over <span>\\(\\mathbb {F}_{p^n}\\)</span>, where <span>\\(u\\in \\mathbb {F}_{p^n}\\)</span>. It was initially studied by Ness and Helleseth in the ternary case. In this paper, for <span>\\(p^n \\equiv 3 \\pmod 4\\)</span> and <span>\\(p^n \\ge 7\\)</span>, we provide the necessary and sufficient condition for <span>\\(f_u(x)\\)</span> to be an APN function. In addition, for each <i>u</i> satisfying <span>\\(\\chi (u+1) = \\chi (u-1)\\)</span>, the differential spectrum of <span>\\(f_u(x)\\)</span> is investigated, and it is expressed in terms of some quadratic character sums of cubic polynomials, where <span>\\(\\chi (\\cdot )\\)</span> denotes the quadratic character of <span>\\({\\mathbb {F}}_{p^n}\\)</span>.\n</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"9 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Further investigation on differential properties of the generalized Ness–Helleseth function\",\"authors\":\"Yongbo Xia, Chunlei Li, Furong Bao, Shaoping Chen, Tor Helleseth\",\"doi\":\"10.1007/s10623-024-01525-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Let <i>n</i> be an odd positive integer, <i>p</i> be an odd prime with <span>\\\\(p\\\\equiv 3\\\\pmod 4\\\\)</span>, <span>\\\\(d_{1} = {{p^{n}-1}\\\\over {2}} -1 \\\\)</span> and <span>\\\\(d_{2} =p^{n}-2\\\\)</span>. The function defined by <span>\\\\(f_u(x)=ux^{d_{1}}+x^{d_{2}}\\\\)</span> is called the generalized Ness–Helleseth function over <span>\\\\(\\\\mathbb {F}_{p^n}\\\\)</span>, where <span>\\\\(u\\\\in \\\\mathbb {F}_{p^n}\\\\)</span>. It was initially studied by Ness and Helleseth in the ternary case. In this paper, for <span>\\\\(p^n \\\\equiv 3 \\\\pmod 4\\\\)</span> and <span>\\\\(p^n \\\\ge 7\\\\)</span>, we provide the necessary and sufficient condition for <span>\\\\(f_u(x)\\\\)</span> to be an APN function. In addition, for each <i>u</i> satisfying <span>\\\\(\\\\chi (u+1) = \\\\chi (u-1)\\\\)</span>, the differential spectrum of <span>\\\\(f_u(x)\\\\)</span> is investigated, and it is expressed in terms of some quadratic character sums of cubic polynomials, where <span>\\\\(\\\\chi (\\\\cdot )\\\\)</span> denotes the quadratic character of <span>\\\\({\\\\mathbb {F}}_{p^n}\\\\)</span>.\\n</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01525-4\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01525-4","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Further investigation on differential properties of the generalized Ness–Helleseth function
Let n be an odd positive integer, p be an odd prime with \(p\equiv 3\pmod 4\), \(d_{1} = {{p^{n}-1}\over {2}} -1 \) and \(d_{2} =p^{n}-2\). The function defined by \(f_u(x)=ux^{d_{1}}+x^{d_{2}}\) is called the generalized Ness–Helleseth function over \(\mathbb {F}_{p^n}\), where \(u\in \mathbb {F}_{p^n}\). It was initially studied by Ness and Helleseth in the ternary case. In this paper, for \(p^n \equiv 3 \pmod 4\) and \(p^n \ge 7\), we provide the necessary and sufficient condition for \(f_u(x)\) to be an APN function. In addition, for each u satisfying \(\chi (u+1) = \chi (u-1)\), the differential spectrum of \(f_u(x)\) is investigated, and it is expressed in terms of some quadratic character sums of cubic polynomials, where \(\chi (\cdot )\) denotes the quadratic character of \({\mathbb {F}}_{p^n}\).
期刊介绍:
Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines.
The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome.
The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas.
Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.