GF(p)上钟控序列
CLOCK CONTROLLED SEQUENCES OVER GF(p)
-
摘要: 本文利用有限域GF(p)(p2为素数,1为正整数)上二次特征建立了GF(p)上一类互钟控序列,即LSRg[d0,d1,d2]-互钟控序列。讨论了当用作移位时钟控制的前馈函数g(x1,x2,,xn)为二次型时,LSRg[d0,d1,d2]-互钟控序列的周期和线性复杂度的特点。Abstract: A class of clock-cross-controlled sequences over GF(p) (p 2 is a prime number, 1 is a positive number) using the quadratic character of GF(p), i.e., LSRg[d0,d1,d2]-clock-cross-controlled sequences is introduced. When the feedforward function g(x1,x2,,xn), which is used as the controlling shift clock, is a quadratic form of GF(p), the properties of the period and the linear complexity of this sequences are discussed.
-
Beth T, Piper F C. The Stop-and-Go Generator. Advances in Cry ptology-Proceeding of EUROCRYPT84. Springer Lecture Notes in Computer Science, Vol. 209, 88-92.[2]Smeets B. A Note on Sequences Generated by Clock Controlled Shift Register. EUROCRYPT85, Spring-Verlag, 1986, 142-148.[3]李超.LSRg[d,k]-互钟控序列.通信学报,1992,13(3): 71-73.[4]Lidl R, Niederreiter H. Finite Field. London: Addsion Wesley. Publishing Company. 1983, 282-283. -
计量
- 文章访问数: 2040
- HTML全文浏览量: 88
- PDF下载量: 325
- 被引次数: 0
下载:
