Lower Bounds for the Linear Complexity of Sequences over Residue Rings

Linear feedback shift registers over the ring Z2e can be implemented efficiently on standard microprocessors. The most significant bits of the elements of a sequence in Z2e? constitute a binary pseudo-random sequence. We derive lower bounds for the linear complexity over F2 of these binary sequences.