4 citations · 7 across the 6 of their papers we have counts for
6 papers
On Reed-Muller subcodes, Grassmannian partitions and sum-free functions
Philipp Heering, Christian Kaspers, Vladislav Taranchuk
A function is called th-order sum-free if the sum of its values over any -dimensional affine subspace of is non-…
Nonvanishing -flats of Boolean and vectorial functions
Christian Kaspers
th-order sum-free functions are a natural generalization of APN functions using the concept of (non)vanishing flats. In this paper, we introduce a new combinatorial technique to…
The number of almost perfect nonlinear functions grows exponentially
Christian Kaspers, Yue Zhou
Almost perfect nonlinear (APN) functions play an important role in the design of block ciphers as they offer the strongest resistance against differential cryptanalysis. Despite mo…
A lower bound on the number of inequivalent APN functions
Christian Kaspers, Yue Zhou
In this paper, we establish a lower bound on the total number of inequivalent APN functions on the finite field with elements, where is even. We obtain this result by…
On solving isomorphism problems about 2-designs using block intersection numbers
Christian Kaspers, Alexander Pott
In this paper, we give a partial solution to a new isomorphism problem about - designs from disjoint difference families in finite fields and Galois rings. Our result…
Solving isomorphism problems about 2-designs from disjoint difference families
Christian Kaspers, Alexander Pott
Recently, two new constructions of disjoint difference families in Galois rings were presented by Davis, Huczynska, and Mullen and Momihara. Both were motivated by a we…