Cubic power functions with optimal second-order differential uniformity

• URL: http://arxiv.org/abs/2409.03467v2
• Date: Tue, 1 Oct 2024 09:46:02 GMT
• Title: Cubic power functions with optimal second-order differential uniformity
• Authors: Connor O'Reilly, Ana Sălăgean,
• Abstract summary: We prove that $d=22k+2k+1$ and $gcd(k,n)=1$ have optimal second-order differential uniformity. Up to affine equivalence, these might be the only optimal cubic power functions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We discuss the second-order differential uniformity of vectorial Boolean functions. The closely related notion of second-order zero differential uniformity has recently been studied in connection to resistance to the boomerang attack. We prove that monomial functions with univariate form $x^d$ where $d=2^{2k}+2^k+1$ and $\gcd(k,n)=1$ have optimal second-order differential uniformity. Computational results suggest that, up to affine equivalence, these might be the only optimal cubic power functions. We begin work towards generalising such conditions to all monomial functions of algebraic degree 3. We also discuss further questions arising from computational results.

Related papers

• Rényi divergence-based uniformity guarantees for $k$-universal hash functions [59.90381090395222]
  Universal hash functions map the output of a source to random strings over a finite alphabet. We show that it is possible to distill random bits that are nearly uniform, as measured by min-entropy.
  arXiv  Detail & Related papers  (2024-10-21T19:37:35Z)
• On the second-order zero differential properties of several classes of power functions over finite fields [4.100056500795057]
  Feistel Boomerang Connectivity Table (FBCT) is an important cryptanalytic technique on analysing the resistance of the Feistel network-based ciphers to power attacks such as differential and boomerang attacks. In this paper, by computing the number of solutions of specific equations over finite fields, we determine explicitly the second-order zero differential spectra of power functions $x2m+3$ and $x2m+5$. The computation of these entries and the cardinalities in each table aimed to facilitate the analysis of differential and boomerang cryptanalysis of S-boxes.
  arXiv  Detail & Related papers  (2024-09-18T04:27:03Z)
• The second-order zero differential uniformity of the swapped inverse functions over finite fields [2.2120851074630177]
  We investigate the second-order zero differential uniformity of the swapped inverse functions. This paper is the first result to characterize classes of non-power functions with the second-order zero differential uniformity equal to 4, in even characteristic.
  arXiv  Detail & Related papers  (2024-05-27T03:11:57Z)
• Dueling Convex Optimization with General Preferences [85.14061196945599]
  We address the problem of emph optimization with dueling feedback, where the goal is to minimize a convex function given a weaker form of emphilonling feedback. Our main contribution is an efficient algorithm with convergence $smashwidetilde O(epsilon-4p)$ for a smooth convex objective function, and an efficient $smashwidetilde O(epsilon-2p) when the objective is smooth and convex.
  arXiv  Detail & Related papers  (2022-09-27T11:10:41Z)
• Optimal universal quantum circuits for unitary complex conjugation [1.6492989697868894]
  This work presents optimal quantum circuits for transforming a number $k$ of calls of $U_d$ into its complex conjugate $barU_d$. Our circuits admit a parallel implementation and are proven to be optimal for any $k$ and $d$ with an average fidelity of $leftlangleFrightrangle =frack+1d(d-k)$.
  arXiv  Detail & Related papers  (2022-05-31T20:43:29Z)
• Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality [0.0]
  We show that when $f$ is an anti-homomorphism, sequential circuits could exponentially outperform parallel ones. We present explicit constructions on how to obtain such advantages for the unitary inversion task $f(U)=U-1$ and the unitary transposition task $f(U)=UT$.
  arXiv  Detail & Related papers  (2021-09-16T20:10:05Z)
• Submodular + Concave [53.208470310734825]
  It has been well established that first order optimization methods can converge to the maximal objective value of concave functions. In this work, we initiate the determinant of the smooth functions convex body $$F(x) = G(x) +C(x)$. This class of functions is an extension of both concave and continuous DR-submodular functions for which no guarantee is known.
  arXiv  Detail & Related papers  (2021-06-09T01:59:55Z)
• Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria [121.36609493711292]
  We study the application of iterative first-order methods to the problem of computing equilibria of large-scale two-player extensive-form games. By instantiating first-order methods with our regularizers, we develop the first accelerated first-order methods for computing correlated equilibra and ex-ante coordinated team equilibria.
  arXiv  Detail & Related papers  (2021-05-27T06:10:24Z)
• Finding Global Minima via Kernel Approximations [90.42048080064849]
  We consider the global minimization of smooth functions based solely on function evaluations. In this paper, we consider an approach that jointly models the function to approximate and finds a global minimum.
  arXiv  Detail & Related papers  (2020-12-22T12:59:30Z)
• Asymptotics of Entropy-Regularized Optimal Transport via Chaos Decomposition [1.7188280334580195]
  This paper is on the properties of a discrete Schr"odinger bridge as $N$ tends to infinity. We derive the first two error terms of orders $N-1/2$ and $N-1$, respectively. The kernels corresponding to the first and second order chaoses are given by Markov operators which have natural interpretations in the Sinkhorn algorithm.
  arXiv  Detail & Related papers  (2020-11-17T21:55:46Z)
• Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions [84.49087114959872]
  We provide the first non-asymptotic analysis for finding stationary points of nonsmooth, nonsmooth functions. In particular, we study Hadamard semi-differentiable functions, perhaps the largest class of nonsmooth functions.
  arXiv  Detail & Related papers  (2020-02-10T23:23:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.