Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2212.01931v2

Help | Advanced Search

Computer Science > Information Theory

arXiv:2212.01931v2 (cs)
[Submitted on 4 Dec 2022 (v1) , last revised 20 Jul 2023 (this version, v2)]

Title: Differential uniformity properties of some classes of permutation polynomials

Title: 某些排列多项式类的微分均匀性性质

Authors:Kirpa Garg, Sartaj Ul Hasan, Pantelimon Stanica
Abstract: The notion of $c$-differential uniformity has recently received a lot of attention since its proposal~\cite{Ellingsen}, and recently a characterization of perfect $c$-nonlinear functions in terms of difference sets in some quasigroups was obtained in~\cite{AMS22}. Independent of their applications as a measure for certain statistical biases, the construction of functions, especially permutations, with low $c$-differential uniformity is an interesting mathematical problem in this area, and recent work has focused heavily in this direction. We provide a few classes of permutation polynomials with low $c$-differential uniformity. The used technique involves handling various Weil sums, as well as analyzing some equations in finite fields, and we believe these can be of independent interest.
Abstract: $c$-微分均匀性的概念最近由于其提出~\cite{Ellingsen}而受到广泛关注,并且最近在~\cite{AMS22}中获得了关于某些拟群中完美$c$-非线性函数的差集表征。 作为衡量某些统计偏差的指标,它们的构造,特别是具有低$c$-微分均匀性的函数,尤其是排列,在这个领域是一个有趣的数学问题,最近的工作在此方向上投入了大量精力。 我们提供了几类具有低$c$-微分均匀性的排列多项式。 所使用的技术涉及处理各种Weil和,以及分析有限域中的一些方程,我们认为这些可能有独立的兴趣。
Subjects: Information Theory (cs.IT) ; Number Theory (math.NT)
Cite as: arXiv:2212.01931 [cs.IT]
  (or arXiv:2212.01931v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2212.01931
arXiv-issued DOI via DataCite

Submission history

From: Sartaj Ul Hasan [view email]
[v1] Sun, 4 Dec 2022 21:34:15 UTC (21 KB)
[v2] Thu, 20 Jul 2023 16:13:21 UTC (22 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
math
math.IT
math.NT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号