Related papers: On CCZ-equivalence of the inverse function
Planar functions are functions over a finite field that have optimal combinatorial properties and they have applications in several branches of mathematics, including algebra, projective geometry and cryptography. There are two relevant…
Let $\mathcal S$ denote the class of all functions of the form $f(z)=z+a_2z^2+a_3z^3+\cdots$ which are analytic and univalent in the open unit disk $\ID$ and, for $\lambda >0$, let $\Phi_\lambda (n,f)=\lambda a_n^2-a_{2n-1}$ denote the…
We investigate the subclass of reversible functions that are self-inverse and relate them to reversible circuits that are equal to their reverse circuit, which are called palindromic circuits. We precisely determine which self-inverse…
For $ -1 \leq B \leq 1$ and $A>B$, let $\mathcal{S}^*[A,B]$ denote the class of generalized Janowski starlike functions consisting of all normalized analytic functions $f$ defined by the subordination $z f'(z)/f(z) \prec (1+ A z)/(1+ B z)$…
We give an example of a function $f$ non-vanishing in the closed bidisk and the affine polynomial minimizing the norm of $1-pf$ in the Hardy space of the bidisk among all affine polynomials $p$. We show that this polynomial vanishes inside…
Functions with low differential uniformity have relevant applications in cryptography. Recently, functions with low $c$-differential uniformity attracted lots of attention. In particular, so-called APcN and PcN functions (generalization of…
The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…
The classical Hurwitz theorem says that if n first "harmonics" (2n + 1 Fourier coefficients) of a continuous function f(x) on the unit circle are zero, then f(x) changes sign at least 2n + 1 times. We show that similar facts and its…
Given constants $x, \nu \in \mathbb{C}$ and the space $\mathscr{H}_0$ of entire functions in $\mathbb{C}$ vanishing at $0$, we consider the integro-differential operator $$ \mathfrak{L} = \left ( \frac{x \, \nu(1-\nu)}{1-x} \right ) \;…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
Recently, the investigation of Partially APN functions has attracted a lot of attention. In this paper, with the help of resultant elimination and MAGMA, we propose several new infinite classes of 0-APN power functions over…
I present an inverse function theorem for differentiable maps between Frechet spaces which contains the classical theorem of Nash and Moser as a particular case. In contrast to the latter, the proof does not rely on the Newton iteration…
Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…
The Cauchy integral formula in Clifford analysis allows us to associate a holomorphic function $\tilde f:L_n\to \C$ on the Lie ball $L_n$ in $\C^n$ with its monogenic counterpart $f:B_1(0)\to \C^{n+1}$ via the formula $\tilde f(z) =…
In this paper we prove two conjectures stated by Chao-Ping Chen in [Int. Trans. Spec. Funct. 23:12 (2012), 865--873], using a method for proving inequalities of mixed trigonometric polynomial functions.
A Sidon set $S$ in $\mathbb{F}_2^n$ is a set such that $x+y=z+w$ has no solutions $x,y,z,w \in S$ with $x,y,z,w$ all distinct. In this paper, we prove various results on Sidon sets by using or generalizing known cryptographic results. In…
In this work, we construct an explicit, theoretically rigorous deconvolution method that relies entirely on iterative forward convolutions, thus can be numerically implemented. We first prove that convolution with an even Schwartz kernel…
Suppose that $k$ and $N$ are positive integers. Let $f$ be a newform on $\Gamma_0(N)$ of weight $k$ with $L$-function $L_f(s)$. Previous works have studied the zeros of the period polynomial $r_f(z)$, which is a generating function for the…
In quantum cryptography, a one-way permutation is a bounded unitary operator $U:\mathcal{H} \to \mathcal{H}$ on a Hilbert space $\mathcal{H}$ that is easy to compute on every input, but hard to invert given the image of a random input.…
We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial $t(n)\geq (1+\varepsilon)n, \varepsilon>0$, the following are equivalent: - One-way functions exists (which in turn is equivalent to…