Linear Filtering of Nonlinear Shift-Register Sequences

Nonlinear n-stage feedback shift-register sequences over the finite field Fq of period qn − 1 are investigated under linear operations on sequences. We prove that all members of an easily described class of linear combinations of shifted versions of these sequences possess useful properties for cryptographic applications: large periods, large linear complexities and good distribution properties. They typically also have good maximum order complexity values as has been observed experimentally. A running key generator is introduced based on certain nonlinear feedback shift registers with modifiable linear feedforward output functions.

• Type: Conference
• Year: 2005
• Where: WCC
• Authors: Berndt M. Gammel, Rainer Göttfert
• Keywords: Cryptography, Feedback Shift-register Sequences, Large Linear Complexities, Linear, WCC 2005