Iterated Inhomogeneous Polynomials.

Let p be a polynomial, and let p(x) be the result of iterating the polynomial i times, starting at an input x. The case where p(x) is the homogeneous polynomial x has been extensively studied in cryptography. Due to its associated group structure, iterating this polynomial gives rise to a number of interesting cryptographic applications such as time-lock puzzles and verifiable delay functions. On the other hand, the associated group structure leads to quantum attacks on the applications. In this work, we consider whether inhomogeneous polynomials, such as 2x + 3x + 1, can have useful cryptographic applications. We focus on the case of polynomials mod 2, due to some useful mathematical properties. The natural group structure no longer exists, so the quantum attacks but also applications no longer immediately apply. We nevertheless show classical polynomial-time attacks on analogs of hard problems from the homogeneous setting. We conclude by proposing new computational assumptions relating to these inhomogeneous polynomials, with cryptographic applications.