Bounds on the maximum nonlinearity of permutations on the rings \({\mathbb {Z}}_p\) and \({\mathbb {Z}}_{2p}\)

IF 0.6 4区 工程技术 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-01-04 DOI:10.1007/s00200-022-00594-z
Prachi Gupta, P. R. Mishra, Atul Gaur
{"title":"Bounds on the maximum nonlinearity of permutations on the rings \\({\\mathbb {Z}}_p\\) and \\({\\mathbb {Z}}_{2p}\\)","authors":"Prachi Gupta,&nbsp;P. R. Mishra,&nbsp;Atul Gaur","doi":"10.1007/s00200-022-00594-z","DOIUrl":null,"url":null,"abstract":"<div><p>In 2016, Y. Kumar et al. in the paper ‘<i>Affine equivalence and non-linearity of permutations over</i> <span>\\({\\mathbb {Z}}_n\\)</span>’ conjectured that: <i>For</i> <span>\\(n\\ge 3\\)</span>, <i>the nonlinearity of any permutation on</i> <span>\\({\\mathbb {Z}}_n\\)</span>, <i>the ring of integers modulo</i> <i>n</i>, <i>cannot exceed</i> <span>\\(n-2\\)</span>. For an odd prime <i>p</i>, we settle the above conjecture when <span>\\(n=2p\\)</span> and for <span>\\(p\\equiv 3 \\pmod {4}\\)</span> we prove the above conjecture with an improved upper bound. Further, we derive a lower bound on <span>\\(\\max {\\mathcal {N}}{\\mathcal {L}}_n\\)</span> when <i>n</i> is an odd prime or twice of an odd prime where <span>\\(\\max {\\mathcal {N}}{\\mathcal {L}}_n\\)</span> denotes the maximum possible nonlinearity of any permutation on <span>\\({\\mathbb {Z}}_n\\)</span>.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Algebra in Engineering Communication and Computing","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s00200-022-00594-z","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In 2016, Y. Kumar et al. in the paper ‘Affine equivalence and non-linearity of permutations over \({\mathbb {Z}}_n\)’ conjectured that: For \(n\ge 3\), the nonlinearity of any permutation on \({\mathbb {Z}}_n\), the ring of integers modulo n, cannot exceed \(n-2\). For an odd prime p, we settle the above conjecture when \(n=2p\) and for \(p\equiv 3 \pmod {4}\) we prove the above conjecture with an improved upper bound. Further, we derive a lower bound on \(\max {\mathcal {N}}{\mathcal {L}}_n\) when n is an odd prime or twice of an odd prime where \(\max {\mathcal {N}}{\mathcal {L}}_n\) denotes the maximum possible nonlinearity of any permutation on \({\mathbb {Z}}_n\).

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
环$${\mathbb{Z}}_p$$Zp上置换的最大非线性的界$
2016 年,Y. Kumar 等人在《Affine equivalence and non-linearity of permutations over \({\mathbb{Z}}_n\)》一文中提出了如下猜想:对于 \(n\ge 3\), 在 n 的整数环 \({\mathbb {Z}}_n\) 上的任何排列的非线性都不能超过 \(n-2\)。对于奇素数 p,当 \(n=2p\) 时,我们解决了上述猜想;对于 \(p\equiv 3 \pmod {4}\) ,我们用改进的上界证明了上述猜想。此外,当 n 是奇素数或奇素数的两倍时,我们得出了 \(\max {\mathcal {N}}{mathcal {L}}_n\) 的下界,其中 \(\max {\mathcal {N}}{mathcal {L}}_n\)表示 \({\mathbb {Z}}_n\) 上任意置换的最大可能非线性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Applicable Algebra in Engineering Communication and Computing
Applicable Algebra in Engineering Communication and Computing 工程技术-计算机:跨学科应用
CiteScore
2.90
自引率
14.30%
发文量
48
审稿时长
>12 weeks
期刊介绍: Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems. Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology. Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal. On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.
期刊最新文献
Double skew cyclic codes over $$\mathbb {F}_q+v\mathbb {F}_q$$ DNA codes over $$GR(2^{3},d)[X]/\langle X^{2},2X \rangle$$ On reversible DNA codes over the ring $${\mathbb {Z}}_4[u,v]/\langle u^2-2,uv-2,v^2,2u,2v\rangle$$ based on the deletion distance Algebraic lattices coming from $${\mathbb {Z}}$$ -modules generalizing ramified prime ideals in odd prime degree cyclic number fields Constacyclic codes over $${{\mathbb {Z}}_2[u]}/{\langle u^2\rangle }\times {{\mathbb {Z}}_2[u]}/{\langle u^3\rangle }$$ and the MacWilliams identities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1