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.01931v1

Help | Advanced Search

Computer Science > Information Theory

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

Title: Several classes of permutation polynomials and their differential uniformity properties

Title: 一些排列多项式的类及其差分均匀性性质

Authors:Kirpa Garg, Sartaj Ul Hasan, Pantelimon Stanica
Abstract: The notion of $c$-differential uniformity has recently received a lot of popularity because of its potential applications in cryptography (we point out that a connection with difference sets in some quasigroups is already realized for perfect $c$-nonlinear functions, in a recent manuscript~\cite{AMS22}). The construction of functions, especially permutations, with low $c$-differential uniformity is an interesting 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{AMS22}中已经实现了与某些拟群中差集的联系,针对完美$c$-非线性函数)。 构造具有低$c$-微分均匀性的函数,特别是置换函数,是这一领域的一个有趣问题,近期的研究主要集中在这一方向。 我们提供了一些具有低$c$-微分均匀性的置换多项式类。 所使用的技术涉及处理各种Weil和,以及分析有限域中的一些方程,我们认为这些可能具有独立的兴趣。
Subjects: Information Theory (cs.IT) ; Number Theory (math.NT)
Cite as: arXiv:2212.01931 [cs.IT]
  (or arXiv:2212.01931v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2212.01931
arXiv-issued DOI via DataCite

Submission history

From: Pantelimon Stanica [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号