  Though it is well known that the roots of any affine polynomial over a finite
field can be computed by a system of linear equations by using a normal base of
the field, such solving approach appears to be difficult to apply when the
field is fairly large. Thus, it may be of great interest to find an explicit
representation of the solutions independently of the field base. This was
previously done only for quadratic equations over a binary finite field. This
paper gives an explicit representation of solutions for a much wider class of
affine polynomials over a binary prime field.
