English
Related papers

Related papers: The number of almost perfect nonlinear functions g…

200 papers

APN permutations in even dimension are vectorial Boolean functions that play a special role in the design of block ciphers. We study their properties, providing some general results and some applications to the low-dimension cases. In…

Cryptography and Security · Computer Science 2017-03-24 Marco Calderini , Massimilano Sala , Irene Villa

Constructing $2m$-variable Boolean functions with optimal algebraic immunity based on decomposition of additive group of the finite field $\mathbb{F}_{2^{2m}}$ seems to be a promising approach since Tu and Deng's work. In this paper, we…

Cryptography and Security · Computer Science 2013-04-11 Jia Zheng , Baofeng Wu , Yufu Chen , Zhuojun Liu

Recently, a new concept called the $c$-differential uniformity was proposed by Ellingsen et al. (2020), which allows to simplify some types of differential cryptanalysis. Since then, finding functions having low $c$-differential uniformity…

Information Theory · Computer Science 2022-06-27 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

The purpose of this paper is to present the extended definitions and characterizations of the classical notions of APN and maximum nonlinear Boolean functions to deal with the case of mappings from a finite group K to another one N with the…

Cryptography and Security · Computer Science 2011-09-26 Laurent Poinsot , Alexander Pott

The investigation of partially APN functions has attracted a lot of research interest recently. In this paper, we present several new infinite classes of 0-APN power functions over $\mathbb{F}_{2^n}$ by using the multivariate method and…

Information Theory · Computer Science 2022-12-12 Yuying Man , Shizhu Tian , Nian Li , Xiangyong Zeng

We study in this paper very badly approximable matrix functions on the unit circle $\T$, i.e., matrix functions $\Phi$ such that the zero function is a superoptimal approximation of $\Phi$. The purpose of this paper is to obtain a…

Functional Analysis · Mathematics 2016-09-07 V. V. Peller , S. R. Treil

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

Number Theory · Mathematics 2026-03-09 Artyom Radomskii

A real valued function $f$ defined on a convex $K$ is anemconvex function iff it satisfies $$ f((x+y)/2) \le (f(x)+f(y))/2 + 1. $$ A thorough study of approximately convex functions is made. The principal results are a sharp universal upper…

Metric Geometry · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

The height $H(n)$ of $n$ is the least integer $i$ such that the $i$-th iterate of Euler's totient function $\varphi^{(i)}(n)$ equals $1$. H. N. Shapiro showed that this $H$ is almost completely additive. Building on the fact that this…

Combinatorics · Mathematics 2026-01-28 Hartosh Singh Bal

Let $m$ be a positive integer and let $\rho(m,n)$ be the proportion of permutations of the symmetric group ${\rm Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $\rho(n,m)n^{1-\frac{\phi(m)}{m}}\sim \kappa_m$ where…

Combinatorics · Mathematics 2019-04-19 John Bamberg , S. P. Glasby , Scott Harper , Cheryl E. Praeger

For a bounded function $\varphi$ on the unit circle $\mathbb T$, let $T_\varphi$ be the associated Toeplitz operator on the Hardy space $H^2$. Assume that the kernel $$K_2(\varphi):=\{f\in H^2:\,T_\varphi f=0\}$$ is nontrivial. Given a…

Complex Variables · Mathematics 2021-04-30 Konstantin M. Dyakonov

We give improved and almost optimal testers for several classes of Boolean functions on $n$ inputs that have concise representation in the uniform and distribution-free model. Classes, such as $k$-junta, $k$-linear functions, $s$-term DNF,…

Data Structures and Algorithms · Computer Science 2023-06-22 Nader H. Bshouty

We prove that for a homogeneous linear partial differential operator $\mathcal A$ of order $k \le 2$ and an integrable map $f$ taking values in the essential range of that operator, there exists a function $u$ of special bounded variation…

Analysis of PDEs · Mathematics 2023-10-06 Adolfo Arroyo-Rabasa

We consider some second order quasilinear partial differential inequalities for real valued functions on the unit ball and find conditions under which there is a lower bound for the supremum of nonnegative solutions that do not vanish at…

Complex Variables · Mathematics 2009-07-21 Adam Coffman , Yifei Pan

Tensor product function (TPF) approximations have been widely adopted in solving high-dimensional problems, such as partial differential equations and eigenvalue problems, achieving desirable accuracy with computational overhead that scales…

Numerical Analysis · Mathematics 2026-04-17 Yuyang Wang , Yukuan Hu , Xin Liu

One of the major open problems in complexity theory is to demonstrate an explicit function which requires super logarithmic depth, a.k.a, the $\mathbf{P}$ versus $\mathbf{NC^1}$ problem. The current best depth lower bound is $(3-o(1))\cdot…

Computational Complexity · Computer Science 2024-04-25 Hao Wu

In this paper, we study the Hamming distance between vectorial Boolean functions and affine functions. This parameter is known to be related to the non-linearity and differential uniformity of vectorial functions, while the calculation of…

Combinatorics · Mathematics 2025-03-07 Gabor P. Nagy

Specific vectorial boolean functions, such as S-Boxes or APN functions have many applications, for instance in symmetric ciphers. In cryptography they must satisfy some criteria (balancedness, high nonlinearity, high algebraic degree,…

Cryptography and Security · Computer Science 2014-11-11 Jean-Guillaume Dumas , Jean-Baptiste Orfila

We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of $F(x)=x^{2^e}h(\Tr_{2^{2m}/2^m}(x))$, where $e\geq0$ and $h(x)$ is a permutation over $\F_{2^m}$. If…

Information Theory · Computer Science 2023-06-01 Xianhong Xie , Yi Ouyang

Let $ACC \circ THR$ be the class of constant-depth circuits comprised of AND, OR, and MOD$m$ gates (for some constant $m > 1$), with a bottom layer of gates computing arbitrary linear threshold functions. This class of circuits can be seen…

Computational Complexity · Computer Science 2014-01-13 Ryan Williams
‹ Prev 1 3 4 5 6 7 10 Next ›