Fp上pn-周期序列的1-错线性复杂度

朱凤翔; 戚文峰

doi:10.3724/SP.J.1146.2006.01568

Fp上pn-周期序列的1-错线性复杂度

doi: 10.3724/SP.J.1146.2006.01568

基金项目:

国家自然科学基金(60673081)和国家863项目(2006AA01Z417)资助课题

计量
- 文章访问数: 3265
- HTML全文浏览量: 86
- PDF下载量: 567
- 被引次数: 0
出版历程
- 收稿日期: 2006-10-17
- 修回日期: 2007-04-02
- 刊出日期: 2007-09-19

1-error Linear Complexity of pn-Periodic Sequences over Fp

摘要

摘要: 周期序列的线性复杂度和k-错线性复杂度是衡量密钥流序列随机性的两个重要指标。该文给出了Fp上pn-周期的序列所有可能的1-错线性复杂度的值以及具有给定1-错线性复杂度的序列个数。更进一步, 该文给出了 Fp上pn-周期的序列1-错线性复杂度的期望。
- 线性复杂度;1-错线性复杂度; Fp上周期序列;广义Chan-Games算法
Abstract: The linear complexity and the k-errorlinear complexity of a periodic sequence are two important standards to scale the randomicity of keystreams. For a pn-periodic sequence over Fp, the possible values of the 1-error linear complexity and the number of sequences with certain 1-error linear complexity are established. Moreover, the expected value of the 1-error linear complexity for a random pn-periodic sequence over Fp is also given.

HTML全文

参考文献(1)

Ding C, Xiao G, and Shan W, et al.. The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1991, Vol. 561, Chap 5.[2]Stamp M and Martin C F, et al.. An algorithm for the k-error linear complexity of binary sequences with period 2n. IEEE Trans. on Inform. Theory, 1993, IT-39(4): 1398-1401.[3]Aly H and Winterhof A, et al.. On the k-error linear complexity over. Fp of legendre and sidelnikov sequences. Designs. Codes and Cryptography, 2006, 40(3): 369-374.[4]Eun Y, Song H, and Kyureghyan G M, et al.. One-error linear complexity over Fp of sidelnikov sequences[J].Sequences and their Applications-SETA 2004, Lecture Notes in Computer Sciences.2005, 3486:154-165[5]Meidl W. On the stability of 2n-periodic binary sequences. IEEE Trans. Inform. Theory, 2005, IT-51(3): 1151-1155.[6]Meidl W and Niederreiter H, et al.. On the expected value of linear complexity and the k-error linear complexity of periodic sequences. IEEE Trans. on Inform. Theory, 2002, IT-48(11): 2817-2825.[7]Meidl W and Niederreiter H. Linear complexity, k-error linear complexity and the descrete fourier transform[J].Journal of Complexity.2002, 18(1):87-103[8]Kaida T.[J].Uehara S, and Imamura K, et al.. On the profile of the k-error linear complexity and the zero sum property for sequences over GF(pm) with period pn. Sequences and their Applications01, Bergen, Norway.2001,(3):13-17[9]Zhu fengxiang and Qi wenfeng. The 2-error linear complexity of 2n-Periodic Binary Sequences with linear complexity 2n-1[J].Journal of Electronics (China),2007, 24(3):390-395[10]Kurosaa K, Sato F, Sakata T, and Kishimoto W, et al.. A relationship between linear complexity and k-error linear complexity. IEEE Trans. on Inform. Theory, 2002, IT-46(2): 694-698.[11]Kaida T, Uehara S and Imamura K, et al.. An algorithm for the k-error linear complexity of sequences over GF(pm) with period pn, p a prime[J].Information and Computation.1999, 151(2):134-147

施引文献

资源附件(0)

访问统计