Searcharxiv⌕ Search

arXiv subjects

Kirpa Garg

Publications and source records attributed to Kirpa Garg.

10 recordsLinked to original sources

On the boomerang spectrum of the APN power function $x^{q+2}$ over $\F_{q^2}$

We study the boomerang spectrum of the almost perfect nonlinear power function $x^{q+2}$ over $\F_{q^2}$, where $q$ is an odd prime power with $q\equiv1\pmod6$. The connection of Pal and Stănică between boomerang entries and $(-1)$-differential entries reduces the problem to counting roots of a single equation. We determine the complete contribution from nonzero parameters in $\F_q$. For parameters outside $\F_q$, we obtain a quintic over $\F_q$ in terms of the parameter's trace and norm, with a separate formula when the trace is zero. We exclude the entry four when $q\equiv1\pmod{12}$ and characterize its occurrence when $q\equiv7\pmod{12}$ through a repeated-root parametrization and a residual cubic. We also evaluate the first nonsubfield moment and an aggregate quadratic-character sum, and prove a Weil bound for each nonzero trace. Explicit secant and residual-cubic formulas express the second, third, and fourth falling-factorial moments as finite sums. Once the size-four frequency is known, these moments recover all remaining frequencies through a nonsingular five-dimensional system. A closed-form evaluation of the nonsubfield distribution remains open.

cs.IT↗

Differential-linear profiles over finite fields of arbitrary characteristic

The (binary) differential-linear connectivity table (DLCT) measures the dependence between an input difference and a linear mask applied to the corresponding output difference. For vectorial Boolean functions, each DLCT entry is one half of an additive autocorrelation value. We extend this relation to functions over finite fields of arbitrary prime characteristic by introducing a level-resolved p-ary differential-linear profile. Its entries are the centered numbers of inputs for which a derivative component has each prescribed trace value in $\mathbb{F}_p$. The discrete Fourier transform of this profile is the family of additive autocorrelations obtained by multiplying the output mask by the nonzero elements of $\mathbb{F}_p$; when p=2, the usual binary identity is recovered. For a fixed input difference, we show that the profiles over all nonzero output masks determine the corresponding DDT row exactly, and we give an explicit inversion formula. We establish a second-moment identity: the total profile energy in one derivative direction is a constant multiple of the squared Euclidean distance between that DDT row and the balanced row. Thus this energy is determined by the full row differential spectrum, not by differential uniformity alone. It follows that all profiles in a direction vanish exactly when the derivative is balanced; for square maps in odd characteristic, this gives a characterization of planarity. As concrete odd-characteristic examples, we determine the complete profile of the monomial $x^{p^k+1}$ and derive an exact Kloosterman-sum formula for the inverse monomial. Finally, we determine the behavior of the profiles under equivalence. EA-equivalence reindexes the input and output masks and translates the trace level, whereas a general CCZ equivalence may mix several derivative directions. Nevertheless, for square maps the global nontrivial profile energy is CCZ-invariant.

cs.IT↗

New classes of trace-form permutation polynomials and their compositional inverses

We construct permutation polynomials of the form x + γTr^{q^2}_q(h(x)) over the finite field F_{q^2}. More precisely, we present two families ofpermutation polynomials whose coefficients range over all elements of the field rather than being restricted to a proper subfield. We also compute the compositional inverses of both families. Our techniques involve the evaluation of certain Kloosterman sums together with the analysis of some equations over finite fields, and we believe these can be of independent interest.

math.NT↗

Some new results on permutation trinomials over finite fields with even characteristic

The construction of permutation trinomials of the form $X^r(X^{α(2^m-1)}+X^{β(2^m-1)} + 1)$ over $\F_{2^{2m}}$, where $m,~r\text{ and }α> β$ are positive integers, is an active area of research. Several classes of permutation trinomials with fixed values of $α$, $β$ and $r$ have been studied. Here, we construct three new classes of permutation trinomials with $(α,β,r)\in\{(7,5,7),(8,6,9),(10,4,11)\}$ over $\F_{2^{2m}}$. We also analyze the quasi-multiplicative equivalence of the newly obtained classes of permutation trinomials to both the existing ones and to each other. Additionally, we prove the nonexistence of a class of permutation trinomials over $\F_{2^{2m}}$ of the same type for $r=9$, $α=7$, and $β=3$ when $m > 3$. Furthermore, we provide a proof for a conjecture on the quasi-multiplicative equivalence of two classes of permutation trinomials, as proposed by Yadav, Gupta, Singh, and Yadav (2024).

math.NT↗

Permutation polynomials over finite fields from low-degree rational functions

This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six classes of permutation pentanomials over $F_{q^2}$. Additionally, we show that the obtained binomials and pentanomials are quasi-multiplicative inequivalent to the known ones in the literature.

cs.CR↗

The revised boomerang connectivity tables and their connection to the Difference Distribution Table

It is well-known that functions over finite fields play a crucial role in designing substitution boxes (S-boxes) in modern block ciphers. In order to analyze the security of an S-box, recently, three new tables have been introduced: the Extended Boomerang Connectivity Table (EBCT), the Lower Boomerang Connectivity Table (LBCT), and the Upper Boomerang Connectivity Table (UBCT). In fact, these tables offer improved methods over the usual Boomerang Connectivity Table (BCT) for analyzing the security of S-boxes against boomerang-style attacks. Here, we put in context these new EBCT, LBCT, and UBCT concepts by connecting them to the DDT for a differentially $δ$-uniform function and also determine the EBCT, LBCT, and UBCT entries of three classes of differentially $4$-uniform power permutations, namely, Gold, Kasami and Bracken-Leander. We also determine the Double Boomerang Connectivity Table (DBCT) entries of the Gold function. As byproducts of our approach, we obtain some previously published results quite easily.

cs.CR↗

The second-order zero differential spectra of some functions over finite fields

It was shown by Boukerrou et al.~[IACR Trans. Symmetric Cryptol. 1 (2020), 331--362] that the $F$-boomerang uniformity (which is the same as the second-order zero differential uniformity in even characteristic) of perfect nonlinear functions is~$0$ on $\F_{p^n}$ ($p$ prime) and the one of almost perfect nonlinear functions on $\F_{2^n}$ is~$0$. It is natural to inquire what happens with APN or other low differential uniform functions in even and odd characteristics. Here, we explicitly determine the second-order zero differential spectra of several maps with low differential uniformity. In particular, we compute the second-order zero differential spectra for some almost perfect nonlinear (APN) functions over finite fields of odd characteristic, pushing further the study started in Boukerrou et al. and continued in Li et al.~[Cryptogr. Commun. 14.3 (2022), 653--662], and it turns out that our considered functions also have low second-order zero differential uniformity. Moreover, we study the second-order zero differential spectra of certain functions with low differential uniformity over finite fields of even characteristic. We connect this new concept to the sum-freedom and vanishing flats concepts and find some counts for the number of vanishing flats via our methods. We provide detailed analyses on several equations over finite fields that may have an interest outside of the scope of our paper.

cs.IT↗

The differential properties of certain permutation polynomials over finite fields

Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear functions and difference sets in some quasigroups was recently shown by Anbar et al. (J. Comb. Des. 31(12):1-24, 2023). Additionally, in a recent manuscript by Pal et al. (Adv. Math. Communications, to appear), a very interesting connection between the $c$-differential uniformity and boomerang uniformity, when $c=-1$, was pointed out, showing that they are the same for an odd APN permutation, sparking yet more interest in the construction of functions with low $c$-differential uniformity. We investigate the $c$-differential uniformity of some classes of permutation polynomials. As a result, we add four more classes of permutation polynomials to the family of functions that only contains a few (non-trivial) perfect $c$-nonlinear functions over finite fields of even characteristic. Moreover, we include a class of permutation polynomials with low $c$-differential uniformity over the field of characteristic~$3$. To solve the involved equations over finite fields, we use various number theoretical techniques, in particular, we find explicitly many Walsh transform coefficients and Weil sums that may be of an independent interest.

math.CO↗

The second-order zero differential spectra of some APN and other maps over finite fields

The Feistel Boomerang Connectivity Table and the related notion of $F$-Boomerang uniformity (also known as the second-order zero differential uniformity) has been recently introduced by Boukerrou et al.~\cite{Bouk}. These tools shall provide a major impetus in the analysis of the security of the Feistel network-based ciphers. In the same paper, a characterization of almost perfect nonlinear functions (APN) over fields of even characteristic in terms of second-order zero differential uniformity was also given. Here, we find a sufficient condition for an odd or even function over fields of odd characteristic to be an APN function, in terms of second-order zero differential uniformity. Moreover, we compute the second-order zero differential spectra of several APN or other low differential uniform functions, and show that our considered functions also have low second-order zero differential uniformity, though it may vary widely, unlike the case for even characteristic when it is always zero.

cs.IT↗

Differential uniformity properties of some classes of permutation polynomials

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.

cs.IT↗