International Telemetering Conference Proceedings / October 25-28, 1999 / Riviera Hotel and Convention Center, Las Vegas, Nevada / Because of the limits of feedback devices, high-speed pseudo-noise code generators cannot depend simply on the improvement of clock rate. Based on the characteristic equation of linear feedback registers and the m-sequence sampling theory as well, deduction is made to indicate a novel way to improve the speed of pseudo-noise code generators 2^l (2^l < n, n is the length of registers) times as fast as the conventional one. Also, we extend our applications to non-reducible and non-primitive polynomials. It could be a good way to generate these linear codes at higher rates.

The linear feedback shift-register is a widely used tool for generating cryptographic sequences. The properties of the Galois model discussed here offer many opportunities to improve the implementations that already exist. We explore the overall properties of the phases of the Galois model and conjecture a relation with modular Golomb rulers. This conjecture points to an efficient method for constructing non-linear filtering generators which fulfil Golic s design criteria in order to maximise protection against his inversion attack. We also produce a number of methods which can improve the rate of output of sequences by combining particular distinct phases of smaller elementary sequences.