Computer Engineering & Science >
The Linear Complexity of a Family of p-ary d-form Sequences
Received date: 2009-03-21
Revised date: 2009-06-24
Online published: 2011-03-25
Pseudorandom sequences are widely used in secret communications, spread spectrum communications and code division multiple address communications. They are usually used as the key sequences, spread spectrum sequences and address sequences. In the design theory of stream ciphers, complexity is introduced to evaluate the unpredictability of the cipher stream, that is, its level of safety. Linear complexity of sequences is an important measure for security in these applications, and this paper investigates the linear complexity of a family of p-ary d-form sequences under certain conditions, and the upper bound is given. There exists a family of p-ary d-form sequences whose linear complexity can reach the upper bound , which suggests that our upper bound is tight.
REN Bo,XIE Duanqiang . The Linear Complexity of a Family of p-ary d-form Sequences[J]. Computer Engineering & Science, 2011 , 33(3) : 18 -22 . DOI: 10.3969/j.issn.1007130X.2011.
［1］Scholtz R,Welch L.GMW Sequences［J］. IEEE Transaction on Information Theory,1984,30(3):548553.
［2］Gong G.Qary Cascaded GMW Sequences［J］. IEEE Transaction on Information Theory,1996,42(1):263267.
［3］李超，黄泽明，杜艳玲.P元扩展序列的线性复杂度［J］.高校应用数学学报，2007，22（3）：349354.
［4］Klapper A M.DForm Sequences:Families of Sequences with Low Correlation Values and Large Linear Spans［J］.IEEE Transaction on Information Theory,1995,41(2):423431.
［5］闫统江.伪随机序列的构造及其性质研究:［博士学位论文］［D］.西安：西安电子科技大学，2007.
［6］田金兵，曾祥勇，胡磊.一类低相关序列集的线性复杂度研究［J］.通信学报，2008，29（3）：7580.
［7］No J S.Pary DForm Sequences with the Ideal Autocorrelation Property［C］∥Proc of IEEE Int’l Symp on Information Theory, 2001:2429.
［8］Du X,Chen Z,Xiao G.On the Linear Complexity of Some New Qary Sequences［J］.Information Sciences, 2008,178(16):33003306..
［9］Lidl R,Niederreiter H.Finite Fields［M］.Cambridge University Press,1997.
［10］Golomb S,Gong G.Signal Design for Good Correlation – for Wireless Communication,Cryptography, and Radar［M］.Cambridge University Press,2005:166167.
［11］Markus A,Leopold B.Complex Sequences over GF(pM) with a TwoLevel Autocorrelation Function and a Large Linear Span［J］.IEEE Transaction on Information Theory,1992,38(1):120130.
［12］丁存生，肖国镇.流密码学及其应用［M］.北京：国防工业出版社，1994:4954.
［13］Brualdi R A.组合数学［M］.冯舜玺，等译.北京：机械工业出版社，2001:9193.
［14］Bosma W,Cannon J,Playoust C,et al.Solving Problemswith Magma［M］.University of Sydney,2006.
［15］Park W J,Komo J J.Relationships Between mSequences over GF(q) and GF(qm)［J］.IEEE Transaction on Information Theory,1989,35(1):183186.
/
| 〈 |
|
〉 |