The binary Gold function and its \(c\)-boomerang connectivity table
From MaRDI portal
Publication:2096653
DOI10.1007/s12095-022-00573-8zbMath1501.11104arXiv2009.09340OpenAlexW3198734649WikidataQ114849136 ScholiaQ114849136MaRDI QIDQ2096653
Sartaj Ul Hasan, Pantelimon Stănică, Mohit Pal
Publication date: 11 November 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.09340
Cryptography (94A60) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20) Other character sums and Gauss sums (11T24)
Related Items (5)
A note on the \(c\)-differential spectrum of an AP\(c\)N function ⋮ Boomerang uniformity of some classes of functions over finite fields ⋮ A class of power mappings with low boomerang uniformity ⋮ The differential spectrum and boomerang spectrum of a class of locally-APN functions ⋮ Several classes of PcN power functions over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boomerang Connectivity Table: a new cryptanalysis tool
- Some classes of power functions with low \(c\)-differential uniformity over finite fields
- The \(c\)-differential behavior of the inverse function under the \textit{EA}-equivalence
- Low \(c\)-differential and \(c\)-boomerang uniformity of the swapped inverse function
- Characters, Weil sums and \(c\)-differential uniformity with an application to the perturbed Gold function
- On the \(c\)-differential uniformity of certain maps over finite fields
- Investigations on \(c\)-boomerang uniformity and perfect nonlinearity
- Boomerang uniformity of a class of power maps
- On construction and (non)existence of \(c\)-(almost) perfect nonlinear functions
- The c-Differential Uniformity and Boomerang Uniformity of Two Classes of Permutation Polynomials
- Investigations on c-(Almost) Perfect Nonlinear Functions
- C-Differentials, Multiplicative Uniformity, and (Almost) Perfect c-Nonlinearity
- New Results About the Boomerang Uniformity of Permutation Polynomials
- Boolean Functions for Cryptography and Coding Theory
- Using double Weil sums in finding the \(c\)-boomerang connectivity table for monomial functions on finite fields
This page was built for publication: The binary Gold function and its \(c\)-boomerang connectivity table