In this paper, the conventional pseudo-random sequence linear complexity is discussed, and a new criterion is proposed, based on the approximate entropy.
分析了已有的序列线性复杂度分析方法，提出了用近似熵算法计算混沌运动的测度熵，作为衡量混沌伪随机序列复杂度的标准。
Linear complexity theory be applied to cryptographic technology, designing a testing method of a random sequence.
文章把线性复杂度理论检用于密码技术中，设计一种实用的序列随机性检验方法。
Moreover, the period and linear complexity of the generated sequence based on primitive trinomials and quarternomials of degree nover GF(3) are discussed.
进一步讨论了基于GF（3）上本原三项式和四项式的自缩序列的周期和线性复杂度。
应用推荐