On Functions of Linear Shift Register Sequences

Abstract

This paper is intended as an overview, presenting several results on the linear complexity of sequences obtained from functions applied to linear shift register sequences. Especially for cryptologic applications it is of course highly desirable that the linear complexity be as large as possible, and not only to get a huge period. The theory reviewed in this paper contains several criteria on how to achieve such goals.