Common composites of triangular polynomial systems and hash functions

Abstract

We study common composites of triangular polynomial and rational function systems with favorable effects under composition: polynomial degree growth. We construct classes of such systems that do not have common composites. This property makes them suitable for the construction of a recently proposed hash function. We give estimates for the number of collisions of this hash function using these systems. We also mention as future work the study of common composites of systems with sparse representation and pose an open problem related to their usability as hash functions.