An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalize...An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2' and the algorithm for computing the linear complexity of a binary sequence with period pn, where 2 is a primitive root modulo p2.展开更多
The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are tw...The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd(p-1, q-1) = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.展开更多
Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given ...Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period over using Discrete Fourier Transform (DFT), where and the characteristics of are odd primes, gcd and is a primitive root modulo The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher.展开更多
Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = ...Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.展开更多
复杂性为序列测量,例如线性复杂性和 k 错误线性复杂性,在溪流零起一个重要作用。这贡献学习二进制代码的线性复杂性与任意的主要时期定序的 1 错误的分发。为任何奇怪的主要 N,在场的作者 N 周期的二进制代码的线性复杂性定序的 1 ...复杂性为序列测量,例如线性复杂性和 k 错误线性复杂性,在溪流零起一个重要作用。这贡献学习二进制代码的线性复杂性与任意的主要时期定序的 1 错误的分发。为任何奇怪的主要 N,在场的作者 N 周期的二进制代码的线性复杂性定序的 1 错误的所有可能的值,并且导出准确公式与任何给定的 1 错误数 N 周期的二进制序列的数字线性复杂性。展开更多
Using the fact that the factorization of x^N — 1 over GF(2) is especiallyexplicit, we completely establish the distributions and the expected values of the lineal complexityand the k-error linear complexity of the N-...Using the fact that the factorization of x^N — 1 over GF(2) is especiallyexplicit, we completely establish the distributions and the expected values of the lineal complexityand the k-error linear complexity of the N-periodic sequences respectively,where N is an odd primeand 2 is a primitive root modulo N. The results show that there are a large percentage of sequenceswith both the linear complexity and the k-enor linear complexity not less than N, quite close totheir maximum possible values.展开更多
基金This work was supported in part by the National Natural Science Foundation of China ( Grant No.60073051) the Natural Science Foundation of Education Council of Anhui Province.
文摘An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2' and the algorithm for computing the linear complexity of a binary sequence with period pn, where 2 is a primitive root modulo p2.
基金Supported by the National Natural Science Foun-dation of China (60373092)
文摘The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd(p-1, q-1) = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.
基金Supported by the National Natural Science Foundation of China (No. 60973125)
文摘Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period over using Discrete Fourier Transform (DFT), where and the characteristics of are odd primes, gcd and is a primitive root modulo The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher.
基金the National Natural Science Foundation of China (No.60373092).
文摘Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.
基金supported by the National Natural Science Foundation of China under Grant Nos.61070178, 61100200,and 60833008
文摘复杂性为序列测量,例如线性复杂性和 k 错误线性复杂性,在溪流零起一个重要作用。这贡献学习二进制代码的线性复杂性与任意的主要时期定序的 1 错误的分发。为任何奇怪的主要 N,在场的作者 N 周期的二进制代码的线性复杂性定序的 1 错误的所有可能的值,并且导出准确公式与任何给定的 1 错误数 N 周期的二进制序列的数字线性复杂性。
文摘Using the fact that the factorization of x^N — 1 over GF(2) is especiallyexplicit, we completely establish the distributions and the expected values of the lineal complexityand the k-error linear complexity of the N-periodic sequences respectively,where N is an odd primeand 2 is a primitive root modulo N. The results show that there are a large percentage of sequenceswith both the linear complexity and the k-enor linear complexity not less than N, quite close totheir maximum possible values.