10 papers
Algorithms for computing the permutation resemblance of functions over finite groups
Li-An Chen, Robert S. Coulter
Permutation resemblance measures the distance of a function from being a permutation. Here we show how to determine the permutation resemblance through linear integer programming t…
Permutation resemblance
Li-An Chen, Robert S. Coulter
Motivated by the problem of constructing bijective maps with low differential uniformity, we introduce the notion of permutation resemblance of a function, which looks to measure t…
Bounds on the differential uniformity of the Wan-Lidl polynomials
Li-An Chen, Robert S. Coulter
We study the differential uniformity of the Wan-Lidl polynomials over finite fields. A general upper bound, independent of the order of the field, is established. Additional bounds…
A result on polynomials derived via graph theory
Robert S. Coulter, Stefaan De Winter, Alex Kodess +1
We present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed…
Planar polynomials and an extremal problem of Fischer and Matousek
Robert S. Coulter, Rex W. Matthews, Craig Timmons
Let be a 3-partite graph with vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matouusek asked for the maximum nu…
Giesbrecht's algorithm, the HFE cryptosystem and Ore's -polynomials
Robert S. Coulter, George Havas, Marie Henderson
We report on a recent implementation of Giesbrecht's algorithm for factoring polynomials in a skew-polynomial ring. We also discuss the equivalence between factoring polynomials in…