This paper explores new ways of constructing and implementing random number generators based on linear recurrences in a finite field with 2^w elements, for some integer w. Two types of constructions are examined. Concrete parameter sets are provided for generators with good equidistribution properties and whose speed is comparable to that of the fastest generators currently available. The implementations use precomputed tables to speed up computations in F_2^w.