{"title":"有限域上多项式特征和的魏尔界的改进","authors":"Fengwei Li, Fanhui Meng, Ziling Heng, Qin Yue","doi":"10.1007/s12095-024-00706-1","DOIUrl":null,"url":null,"abstract":"<p>Let <span>\\(\\mathbb {F}_q\\)</span> be a finite field with <i>q</i> elements, where <i>q</i> is a power of a prime <i>p</i>. In this paper, we obtain an improvement on Weil bounds for character sums associated to a polynomial <i>f</i>(<i>x</i>) over <span>\\(\\mathbb {F}_q \\)</span>, which extends the results of Wan et al. (Des. Codes Cryptogr. <b>81</b>, 459–468, 2016) and Wu et al. (Des. Codes Cryptogr. <b>90</b>, 2813–2821, 2022).</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"300 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improvement on Weil bounds for character sums of polynomials over finite fields\",\"authors\":\"Fengwei Li, Fanhui Meng, Ziling Heng, Qin Yue\",\"doi\":\"10.1007/s12095-024-00706-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Let <span>\\\\(\\\\mathbb {F}_q\\\\)</span> be a finite field with <i>q</i> elements, where <i>q</i> is a power of a prime <i>p</i>. In this paper, we obtain an improvement on Weil bounds for character sums associated to a polynomial <i>f</i>(<i>x</i>) over <span>\\\\(\\\\mathbb {F}_q \\\\)</span>, which extends the results of Wan et al. (Des. Codes Cryptogr. <b>81</b>, 459–468, 2016) and Wu et al. (Des. Codes Cryptogr. <b>90</b>, 2813–2821, 2022).</p>\",\"PeriodicalId\":10788,\"journal\":{\"name\":\"Cryptography and Communications\",\"volume\":\"300 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cryptography and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s12095-024-00706-1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cryptography and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s12095-024-00706-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An improvement on Weil bounds for character sums of polynomials over finite fields
Let \(\mathbb {F}_q\) be a finite field with q elements, where q is a power of a prime p. In this paper, we obtain an improvement on Weil bounds for character sums associated to a polynomial f(x) over \(\mathbb {F}_q \), which extends the results of Wan et al. (Des. Codes Cryptogr. 81, 459–468, 2016) and Wu et al. (Des. Codes Cryptogr. 90, 2813–2821, 2022).