共查询到20条相似文献,搜索用时 859 毫秒
1.
2.
3.
该文提出一类新的周期为2pq, p和q为不同奇素数的广义分圆序列,并给出了该序列线性复杂度的计算公式。在已知序列支撑集的情况下,利用该公式可以得到该序列线性复杂度的精确值。 相似文献
4.
5.
6.
本文给出了GF(q)上周期为p的二元广义分圆序列的线性复杂度及极小多项式,其中q=rm,且r为奇素数。结果表明该序列在GF(q)上有高的线性复杂度。 相似文献
7.
8.
9.
10.
11.
线性复杂度和k- 错线性复杂度是度量密钥流序列密码强度的重要指标。为了更好地研究序列的随机性,该文通过将序列的k-错线性复杂度的计算转化为求Hamming重量最小的错误序列的方法,讨论了序列不同k-错线性复杂度条件下对应的k-错误序列的分布情况。基于Games-Chan算法,该文给出了线性复杂度为2n的2n-周期二元序列的3错误序列的计数公式,计算机编程验证了该文方法的正确性。 相似文献
12.
Self-Shrinking Control (SSC) sequences are a class of important pseudo-random sequences, and pseudo-random sequences are widely used in many fields, such as communication encryption, recoding technology. In these applications, sequences are usually required to have large periods and high linear complexity. In order to construct pseudo-random sequences with higher period and higher linear complexity, a new SSC sequence model based on the m-sequence in GF (3) is constructed, the period and the linear complexity of the generated sequence are studied by using finite domain theory, this model greatly improves the period and the linear complexity of the generated sequence, and obtains a more accurate upper bound value of the linear complexity of the generated sequence. Thus, the anti-attack ability and security performance of the generated sequence in communication encryption are improved. 相似文献
13.
周期序列的线性复杂度和k-错线性复杂度是衡量密钥流序列随机性的两个重要指标.该文给出了Fp上pn-周期的序列所有可能的1-错线件复杂度的值以及具有给定1-错线性复杂度的序列个数.更进一步,该文给出了Fp上pn-周期的序列1-错线性复杂度的期望. 相似文献
14.
15.
THE 2-ERROR LINEAR COMPLEXITY OF 2^n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2^n -1 总被引:9,自引:0,他引:9
Zhu Fengxiang Qi Wenfeng 《电子科学学刊(英文版)》2007,24(3):390-395
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. 相似文献
16.
Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/ 总被引:1,自引:0,他引:1
Lauder A.G.B. Paterson K.G. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2003,49(1):273-280
Binary sequences with high linear complexity are of interest in cryptography. The linear complexity should remain high even when a small number of changes are made to the sequence. The error linear complexity spectrum of a sequence reveals how the linear complexity of the sequence varies as an increasing number of the bits of the sequence are changed. We present an algorithm which computes the error linear complexity for binary sequences of period /spl lscr/=2/sup n/ using O(/spl lscr/(log/spl lscr/)/sup 2/) bit operations. The algorithm generalizes both the Games-Chan (1983) and Stamp-Martin (1993) algorithms, which compute the linear complexity and the k-error linear complexity of a binary sequence of period /spl lscr/=2/sup n/, respectively. We also discuss an application of an extension of our algorithm to decoding a class of linear subcodes of Reed-Muller codes. 相似文献
17.
随机周期序列☆错线性复杂度的期望上界 总被引:2,自引:0,他引:2
周期序列的k错线性复杂度是衡量流密码系统的安全性能的一个重要指标。本文给出了周期序列k错线性复杂度上界的一个更强的结果,从而给出了几种不同情形下随机周期序列k错线性复杂度的期望的上界。特别地,还给出了周期N=pv,随机周期序列满足一定条件时1错线性复杂度的期望更紧的结果。 相似文献
18.
19.
20.
钟控生成器是一种重要的密钥流生成器,它产生的钟控序列具有较好的复杂度和较强的伪随机性质。目前提出的钟控模型大多是基于序列的相互控制,对输入序列进行采样,而且经常是一类非均匀采样序列,要研究其性质,就必须对采样序列进行分析。丈中分析了采出序列的周期和线性复杂性与被采序列的周期和线性复杂性之间的关系,并以A5/1算法为例,分析变形后的A5/1算法的输出序列的周期和线性复杂度。 相似文献