1 citations · 1 across the 4 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CC2021
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…
cs.IT2021★ 1 cited
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})…