Primitive transformation shift registers over finite fields
Primitive transformation shift registers over finite fields
Linear feedback shift registers (LFSRs) are widely used cryptographic primitives for generating pseudorandom sequences. Here, we consider systems which are efficient generalizations of LFSRs and produce pseudorandom vector sequences. We study problems related to the cardinality, existence and construction of these systems and give certain results in this direction.