滤波密钥流生成器的全局线性复杂度分析
Global Linear Complexity Analysis of Filter Keystream Generators
摘要：
给出了一种计算非线性滤波PN序列全局线性复杂度下界的有效算法。这里开发的技术完全基于逐位逻辑运算的实现，这使得它适合于软件仿真和硬件实现。本算法可适用于任何具有唯一最高阶项的非线性函数。因此，它对不同类型的滤波器生成器的应用范围相当广泛。此外，重点是在大的下界，确认的指数增长的非线性过滤序列类的全球线性复杂性。
英文摘要：
An efficient algorithm for computing lower bounds on the global linear complexity of nonlinearly filtered PN-sequences is presented. The technique here developed is based exclusively on the realization of bit wise logic operations, which makes it appropriate for both software simulation and hardware implementation. The present algorithm can be applied to any arbitrary nonlinear function with a unique term of maximum order. Thus, the extent of its application for different types of filter generators is quite broad. Furthermore, emphasis is on the large lower bounds obtained that confirm the exponential growth of the global linear complexity for the class of nonlinearly filtered sequences.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
