中文
相关论文

相关论文: Partially APN Boolean functions and classes of fun…

200 篇论文

We consider exceptional APN functions on ${\bf F}_{2^m}$, which by definition are functions that are not APN on infinitely many extensions of ${\bf F}_{2^m}$. Our main result is that polynomial functions of odd degree are not exceptional,…

代数几何 · 数学 2009-11-13 Yves Aubry , Gary Mcguire , François Rodier

In this paper, we show that there is no vectorial Boolean function of degree 4e, with e satisfaying certain conditions, which is APN over infinitely many extensions of its field of definition. It is a new step in the proof of the conjecture…

信息论 · 计算机科学 2013-10-01 Florian Caullery

In this article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…

组合数学 · 数学 2025-01-08 Hiroaki Taniguchi , Alexandr Polujan , Alexander Pott , Razi Arshad

We prove a necessary condition for some polynomials of Kasami degree to be APN over F_{q^n} for large n.

信息论 · 计算机科学 2011-02-01 François Rodier

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.

数论 · 数学 2016-02-03 François Rodier

Almost perfect nonlinear (APN) functions on finite fields of characteristic two have been studied by many researchers. Such functions have useful properties and applications in cryptography, finite geometries and so on. However APN…

组合数学 · 数学 2018-07-09 Masamichi Kuroda , Shuhei Tsujie

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…

密码学与安全 · 计算机科学 2011-09-26 Laurent Poinsot , Alexander Pott

In a recent paper, it is shown that functions of the form $L_1(x^3)+L_2(x^9)$, where $L_1$ and $L_2$ are linear, are a good source for construction of new infinite families of APN functions. In the present work we study necessary and…

密码学与安全 · 计算机科学 2017-10-25 Irene Villa

We show that many quadratic binomial functions on a finite field of characteristic 2 are not APN infinitely often. This is of interest in the light of recent discoveries of new families of quadratic binomial APN functions. The proof uses…

数论 · 数学 2008-10-27 E. Byrne , G. McGuire

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…

信息论 · 计算机科学 2022-09-28 Longjiang Qu , Kangquan Li

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…

信息论 · 计算机科学 2008-05-01 Carl Bracken , Eimear Byrne , Nadya Markin , Gary McGuire

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…

信息论 · 计算机科学 2008-12-01 Carl Bracken , Zhengbang Zha

An almost perfect nonlinear (APN) function (necessarily a polynomial function) on a finite field $\mathbb{F}$ is called exceptional APN, if it is also APN on infinitely many extensions of $\mathbb{F}$. In this article we consider the most…

信息论 · 计算机科学 2012-07-25 Moises Delgado , Heeralal Janwa

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…

信息论 · 计算机科学 2022-10-28 Tao Fu , Haode Yan

The vectorial Boolean functions are employed in cryptography to build block coding algorithms. An important criterion on these functions is their resistance to the differential cryptanalysis. Nyberg defined the notion of almost perfect…

代数几何 · 数学 2008-05-02 François Rodier

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

群论 · 数学 2015-03-09 J. C. Birget

Almost Perfect Nonlinear (APN) functions are very useful in cryptography, when they are used as S-Boxes, because of their good resistance to differential cryptanalysis. An APN function $f:\mathbb{F}_{2^n}\rightarrow\mathbb{F}_{2^n}$ is…

数论 · 数学 2016-02-09 Moises Delgado , Heeralal Janwa

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…

组合数学 · 数学 2016-11-17 Yves Edel , Gohar Kyureghyan , Alexander Pott

Coverage functions are an important subclass of submodular functions, finding applications in machine learning, game theory, social networks, and facility location. We study the complexity of partial function extension to coverage…

数据结构与算法 · 计算机科学 2019-07-18 Umang Bhaskar , Gunjan Kumar

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.…

组合数学 · 数学 2026-03-12 Zeying Wang
‹ 上一页 1 2 3 10 下一页 ›