Let F(x) be a polynomial of
degree D. We say that F(x) is round if all its irreducible factors have relatively
small degree (e.g., bounded by a small multiple of logD). In the present
paper we introduce new methods for the study of round polynomials. Using
these methods we prove the existence of many classes of round trinomials
over GF(2), including all the previously known ones as well as many new
ones.