Nonexistence of generalized bent functions and the quadratic norm form equations

IF 1.2 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2025-03-09 DOI:10.1007/s10623-025-01606-y
Chang Lv, Yuqing Zhu
{"title":"Nonexistence of generalized bent functions and the quadratic norm form equations","authors":"Chang Lv, Yuqing Zhu","doi":"10.1007/s10623-025-01606-y","DOIUrl":null,"url":null,"abstract":"<p>We present a new result on the nonexistence of generalized bent functions (GBFs) from <span>\\((\\mathbb {Z}/t\\mathbb {Z})^n\\)</span> to <span>\\(\\mathbb {Z}/t\\mathbb {Z}\\)</span> (called type [<i>n</i>, <i>t</i>]) for a large class. Assume <i>p</i> is an odd prime number. By showing certain quadratic norm form equations having no integral points, we obtain a universal result on the nonexistence of GBFs with type <span>\\([n, 2p^e]\\)</span> when <i>p</i> and <i>n</i> satisfy a certain inequality, and by computational methods with a widely accepted hypothesis, Generalized Riemann Hypothesis, we also achieve some results on the nonexistence of GBFs for relatively small <i>p</i>.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"127 1","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2025-03-09","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-025-01606-y","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

We present a new result on the nonexistence of generalized bent functions (GBFs) from \((\mathbb {Z}/t\mathbb {Z})^n\) to \(\mathbb {Z}/t\mathbb {Z}\) (called type [nt]) for a large class. Assume p is an odd prime number. By showing certain quadratic norm form equations having no integral points, we obtain a universal result on the nonexistence of GBFs with type \([n, 2p^e]\) when p and n satisfy a certain inequality, and by computational methods with a widely accepted hypothesis, Generalized Riemann Hypothesis, we also achieve some results on the nonexistence of GBFs for relatively small p.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
广义弯曲函数的不存在性与二次范数形式方程
我们给出了一个关于从\((\mathbb {Z}/t\mathbb {Z})^n\)到\(\mathbb {Z}/t\mathbb {Z}\)的广义弯曲函数(称为type [n, t])不存在的新结果。假设p是奇质数。通过给出一些没有积分点的二次范数形式方程,得到了当p和n满足一定不等式时,类型为\([n, 2p^e]\)的gbf不存在的一般结果,并利用一个被广泛接受的假设——广义黎曼假设的计算方法,得到了对于相对较小的p, gbf不存在的一些结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: 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.
期刊最新文献
Cliques in Paley graphs of square order and in Peisert graphs On anti-collusion codes for averaging attack in multimedia fingerprinting LRCS: Duality, LP bounds, and field size Weights of a class of projective geometry codes Codes over an infinite family of local rings of order $$2^{5^k}$$ with two Gray maps
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1