Minimal linear equivalent analysis of a variable-memory binary sequence generator

Abstract

Starting from a memory-based nonlinear generator due to P. R. Geffe (1973), a binary sequence generator (MEM-BSG), consisting of three linear feedback shift registers and a variable memory, is defined and analyzed. The MEM-BSG is shown to be convenient for generating fast binary sequences of large period and linear complexity, which may be useful in spread-spectrum and cryptographic applications.