Hashing by cyclic polynomials is strongly universal or pairwise independent: simply keep the first  bits.
The concept of hashing with cyclic polynomials can be described as being both strongly universal and pairwise independent when using only the initial bits.