1 citations · 1 across the 4 of their papers we have counts for
4 papers
Three Infinite Classes of APN Permutations on
Deng Tang
For any permutation of a nontrivial finite abelian group, the differential uniformity is at least two; permutations attaining this bound are called almost perfect nonlinear (APN).…
On Boolean Functions with Low Polynomial Degree and Higher Order Sensitivity
Subhamoy Maitra, Chandra Sekhar Mukherjee, Pantelimon Stanica +1
Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theo…
Constructing new APN functions through relative trace functions
Lijing Zheng, Haibin Kan, Yanjun Li +2
In 2020, Budaghyan, Helleseth and Kaleyski [IEEE TIT 66(11): 7081-7087, 2020] considered an infinite family of quadrinomials over of the form $x^3+a(x^{2^s+1})…
Binary Linear Codes From Vectorial Boolean Functions and Their Weight Distribution
Deng Tang, Claude Carlet, Zhengchun Zhou
Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communicatio…