English

Low $c$-differential and $c$-boomerang uniformity of the swapped inverse function

Number Theory 2020-09-29 v2 Information Theory math.IT

Abstract

Modifying the binary inverse function in a variety of ways, like swapping two output points has been known to produce a 44-differential uniform permutation function. Recently, in \cite{Li19} it was shown that this swapped version of the inverse function has boomerang uniformity exactly 1010, if n0(mod6)n\equiv 0\pmod 6, 88, if n3(mod6)n\equiv 3\pmod 6, and 6, if n≢0(mod3)n\not\equiv 0\pmod 3. Based upon the cc-differential notion we defined in \cite{EFRST20} and cc-boomerang uniformity from \cite{S20}, in this paper we characterize the cc-differential and cc-boomerang uniformity for the (0,1)(0,1)-swapped inverse function in characteristic~22: we show that for all~c1c\neq 1, the cc-differential uniformity is upper bounded by~44 and the cc-boomerang uniformity by~55 with both bounds being attained for~n4n\geq 4.

Keywords

Cite

@article{arxiv.2009.09268,
  title  = {Low $c$-differential and $c$-boomerang uniformity of the swapped inverse function},
  author = {Pantelimon Stanica},
  journal= {arXiv preprint arXiv:2009.09268},
  year   = {2020}
}

Comments

25 pages