关键词: 自缩序列, 周期, 线性复杂度, 本原三项式, 本原四项式

Abstract: A new self-shrinking model on [GF(3)] constructed with modular addition is presented. The upper bound of the period is [3n], the lower bound is [32n3]; the upper bound of the linear complexity is [3n], the lower bound is [32n3-1]. For the period and complexity of primitive trinomials and primitive quarternomials, the probability achieving better bound value are [89], [56].

Key words: self-shrinking sequence, period, linear complexity, primitive trinomials, primitive quarternomials