English
Related papers

Related papers: Investigations on c-(almost) perfect nonlinear fun…

200 papers

In this paper some cryptographic properties of Boolean functions, including weight, balancedness and nonlinearity, are studied, particularly focusing on splitting functions and cubic Boolean functions. Moreover, we present some quantities…

Cryptography and Security · Computer Science 2024-06-17 Augustine Musukwa , Massimiliano Sala , Marco Zaninelli

Permutations over $F_{2^{2k}}$ with low differential uniform, high algebraic degree and high nonlinearity are of great cryptographical importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers. A well…

Information Theory · Computer Science 2014-07-21 Jie Peng , Chik How Tan , Qichun Wang

Let $F$ be a function from $\mathbb{F}_{p^n}$ to itself and $\delta$ a positive integer. $F$ is called zero-difference $\delta$-balanced if the equation $F(x+a)-F(x)=0$ has exactly $\delta$ solutions for all non-zero $a\in\mathbb{F}_{p^n}$.…

Information Theory · Computer Science 2014-11-03 Claude Carlet , Guang Gong , Yin Tan

The $c$-differential uniformity is recently proposed to reflect resistance against some variants of differential attack. Finding functions with low $c$-differential uniformity is attracting attention from many researchers. For even…

Information Theory · Computer Science 2022-02-07 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

We give a large family of almost perfect nonlinear (APN) permutations of finite vector spaces of every odd dimension divisible by three. We also give APN functions that are not bijective on even dimensions and related highly nonlinear…

Combinatorics · Mathematics 2026-05-19 Faruk Göloğlu , Lukas Kölsch

In this paper, we construct some piecewise defined functions, and study their $c$-differential uniformity. As a by-product, we improve upon several prior results. Further, we look at concatenations of functions with low differential…

Information Theory · Computer Science 2021-12-07 Daniele Bartoli , Marco Calderini , Constanza Riera , Pantelimon Stanica

In this paper we extend the dichotomy given by Samuelsson and Wold that can be thought of as an analogue of the Wermer maximality theorem in $\mathbb{C}^2$ for certain polynomial polyhedra. We consider complex non-degenerate simply…

Complex Variables · Mathematics 2025-03-04 Sushil Gorai , Golam Mostafa Mondal

In the present paper, we obtain a more general conditions for univalence of analytic functions in the open unit disk U. Also, we obtain a refinement to a quasiconformal extension criterion of the main result.

Complex Variables · Mathematics 2013-02-19 Murat Çağlar , Halit Orhan

In this paper, two new classes of perfect nonlinear functions over $\mathbb{F}_{p^{2m}}$ are proposed, where $p$ is an odd prime. Furthermore, we investigate the nucleus of the corresponding semifields of these functions and show that the…

Information Theory · Computer Science 2019-05-09 Jinquan Luo , Junru Ma

Block ciphers use S-boxes to create confusion in the cryptosystems. Such S-boxes are functions over $\mathbb{F}_{2^{n}}$. These functions should have low differential uniformity, high nonlinearity, and high algebraic degree in order to…

Cryptography and Security · Computer Science 2021-03-22 Yan-Ping Wang , WeiGuo Zhang , Zhengbang Zha

In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition. We connect this notion to the known conjecture that APN functions modified at a…

Information Theory · Computer Science 2019-05-31 Lilya Budaghyan , Nikolay S. Kaleyski , Soonhak Kwon , Constanza Riera , Pantelimon Stanica

Two important problems on almost perfect nonlinear (APN) functions are the enumeration and equivalence problems. In this paper, we solve these two problems for any biprojective APN function family by introducing a strong group theoretic…

Combinatorics · Mathematics 2025-03-25 Faruk Göloğlu , Lukas Kölsch

We investigate permutation polynomials F over finite fields F_{p^n} whose generalized derivative maps x -> F(x + a) - cF(x) are themselves permutations for all nonzero shifts a. This property, termed perfect c-nonlinearity (PcN), represents…

Information Theory · Computer Science 2026-02-26 Ranit Dutta , Pantelimon Stanica , Bimal Mandal

It is well known that a quadratic function defined on a finite field of odd degree is almost bent (AB) if and only if it is almost perfect nonlinear (APN). For the even degree case there is no apparent relationship between the values in the…

Information Theory · Computer Science 2008-12-01 Carl Bracken , Zhengbang Zha

Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…

Information Theory · Computer Science 2022-10-20 Haode Yan , Sihem Mesnager , Xiantong Tan

We apply the topology of convergence on compact sets to define unpredictable functions [5, 6]. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and…

Chaotic Dynamics · Physics 2016-11-17 Marat Akhmet , Mehmet Onur Fen

A new almost perfect nonlinear function (APN) on the finite field GF(2^10) which is not equivalent to any of the previously known APN mappings is constructed. This is the first example of an APN mapping which is not equivalent to a power…

Combinatorics · Mathematics 2016-11-17 Yves Edel , Gohar Kyureghyan , Alexander Pott

We consider nonlinear integro-differential equations, like the ones that arise from stochastic control problems with purely jump L\`evy processes. We obtain a nonlocal version of the ABP estimate, Harnack inequality, and interior…

Analysis of PDEs · Mathematics 2010-03-31 Luis Caffarelli , Luis Silvestre

We prove new parameterization theorems for sets definable in the structure $\mathbb{R}_{an}$ (i.e. for globally subanalytic sets) which are uniform for definable families of such sets. We treat both $C^r$-parameterization and (mild)…

Number Theory · Mathematics 2018-05-17 Raf Cluckers , Jonathan Pila , Alex Wilkie

A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…

Symbolic Computation · Computer Science 2014-07-11 Alexandre Benoit , Mioara Joldes , Marc Mezzarobba