English
Related papers

Related papers: A Generalization of APN Functions for Odd Characte…

200 papers

APN functions play a central role as building blocks in the design of many block ciphers, serving as optimal functions to resist differential attacks. One of the most important properties of APN functions is their linearity, which is…

Combinatorics · Mathematics 2026-05-19 Sophie Hannah Bénéteau , Nicolas Goluboff , Lukas Kölsch , Divyesh Vaghasiya

The article is devoted to approximate, global and along curves differentiability of functions over non-archimedean infinite fields with non-trivial valuations. Fields with zero and non-zero characteristics are considered. Spaces of…

Classical Analysis and ODEs · Mathematics 2010-03-16 S. V. Ludkovsky

Recently, a new concept called multiplicative differential cryptanalysis and the corresponding $c$-differential uniformity were introduced by Ellingsen et al.~\cite{Ellingsen2020}, and then some low differential uniformity functions were…

Information Theory · Computer Science 2021-04-28 Xiaoqiang Wang , Dabin Zheng

In this paper we explore a connection between certain Almost Perfect Nonlinear Functions (APN functions) and relative difference sets. In particular, we show that the image set of certain 2-to-1 APN functions is a relative difference set.…

Combinatorics · Mathematics 2026-03-12 Zeying Wang

Functions with low c-differential uniformity have optimal resistance to some types of differential cryptanalysis. In this paper, we investigate the c-differential uniformity of power functions over finite fields. Based on some known almost…

Information Theory · Computer Science 2020-08-28 Zhengbang Zha , Lei Hu

Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…

Information Theory · Computer Science 2015-08-17 Guangkui Xu , Xiwang Cao

We prove a necessary condition for some polynomials of degree 4e (e an odd number) to be APN over F q n for large n, and we investigate the polynomials f of degree 12.

Number Theory · Mathematics 2016-02-03 François Rodier

This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight functions on edges of a graph with weights from a finite field…

Combinatorics · Mathematics 2025-01-23 Aleksey Bolotnikov , Anwar Irmatov

In anomaly detection, the degree of irregularity is often summarized as a real-valued anomaly score. We address the problem of attributing such anomaly scores to input features for interpreting the results of anomaly detection. We…

Machine Learning · Computer Science 2023-07-24 Naoya Takeishi , Yoshinobu Kawahara

Ultrafunctions are a particular class of functions defined on a non-Archimedean field. They provide generalized solutions to functional equations which do not have any solutions among the real functions or the distributions. In this paper…

Functional Analysis · Mathematics 2013-03-01 Vieri Benci , Lorenzo Luperi Baglini

The projection construction has been used to construct semifields of odd characteristic using a field and a twisted semifield [Commutative semifields from projection mappings, Designs, Codes and Cryptography, 61 (2011), 187--196]. We…

Combinatorics · Mathematics 2016-03-02 Stephen M. Gagola , Joanne L. Hall

In 2020, Budaghyan, Helleseth and Kaleyski [IEEE TIT 66(11): 7081-7087, 2020] considered an infinite family of quadrinomials over $\mathbb{F}_{2^{n}}$ of the form $x^3+a(x^{2^s+1})^{2^k}+bx^{3\cdot 2^m}+c(x^{2^{s+m}+2^m})^{2^k}$, where…

Information Theory · Computer Science 2021-01-28 Lijing Zheng , Haibin Kan , Yanjun Li , Jie Peng , Deng Tang

Two-to-one ($2$-to-$1$) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent functions. In this paper we provide a systematic study of…

Information Theory · Computer Science 2019-07-03 Sihem Mesnager , Longjiang Qu

Planar functions are special functions from a finite field to itself that give rise to finite projective planes and other combinatorial objects. We consider polynomials over a finite field $K$ that induce planar functions on infinitely many…

Number Theory · Mathematics 2014-03-18 Florian Caullery , Kai-Uwe Schmidt , Yue Zhou

In this paper disprove a conjecture by Pal and Budaghyan (DCC, 2024) on the existence of a family of APN permutations, but showing that if the field's cardinality $q$ is larger than~$9587$, then those functions will never be APN. Moreover,…

Algebraic Geometry · Mathematics 2025-05-06 Daniele Bartoli , Pantelimon Stanica

In the literature, there are many APN-like functions that generalize the APN properties or are similar to APN functions, e.g. locally-APN functions, 0-APN functions or those with boomerang uniformity 2. In this paper, we study the problem…

Information Theory · Computer Science 2022-09-28 Longjiang Qu , Kangquan Li

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

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

The authors' previous results on the arity gap of functions of several variables are refined by considering polynomial functions over arbitrary fields. We explicitly describe the polynomial functions with arity gap at least 3, as well as…

Rings and Algebras · Mathematics 2013-06-05 Miguel Couceiro , Erkko Lehtonen , Tamás Waldhauser

We present two infinite families of APN functions where the degree of the field is divisible by 3 but not 9. Our families contain two already known families as special cases. We also discuss the inequivalence proof (by computation) which…

Information Theory · Computer Science 2008-05-01 Carl Bracken , Eimear Byrne , Nadya Markin , Gary McGuire