| FCSR序列的线性复杂度 |
| |
| 引用本文： | 戚文峰,徐洪.FCSR序列的线性复杂度[J].高校应用数学学报(英文版),2003,18(3):318-324. |
| |
| 作者姓名： | 戚文峰 徐洪 |
| |
| 作者单位： | Qi Wenfeng Xu HongDept of Appl.Math，Zhengzhou Information Engineering Univ.，Zhengzhou 450002，China |
| |
| 基金项目： | The work is supported by the Special Fund of National Excellently Doctoral Paper and HAIPURT. |
| |
| 摘 要： | § 1 IntroductionFeedback with carry shift register(FCSR) was first introduced by Klapper andGoresky in1 9941 ] .The main idea of FCSR is to add a memory to linearfeedback shiftreg-ister(LFSR) .The structure is depicted in Fig.1 ,Fig.1where mn- 1 ∈Z,ai,qi∈ { 0 ,1 } and qr=1 .We refer to mn- 1 as memory,(mn- 1 ,an- 1 ,...,an- r)as state,r=log(q+ 1 ) as length,and q=-1 + q1 · 2 + ...+ qr· 2 ras connection integerof FCSR.The operation of the shiftregister is defined as follows:(1 …
|
| 收稿时间： | 19 July 2002 |
On the linear complexity of FCSR sequences |
| |
| Qi Wenfeng,Xu Hong.On the linear complexity of FCSR sequences[J].Applied Mathematics A Journal of Chinese Universities,2003,18(3):318-324. |
| |
| Authors: | Qi Wenfeng Xu Hong |
| |
| Institution: | (1) Dept of Appl. Math, Zhengzhou Information Engineering Univ., 450002 Zhengzhou, China |
| |
| Abstract: | The linear complexity of a new kind of keystream sequences. FCSR sequences, is discussed by use of the properties of cyclotomic
polynomials. Based on the results of C. Seo’s, an upper bound and a lower bound on the linear complexity of a significant
kind of FCSR sequences—l-sequences are presented.
The work is supported by the Special Fund of National Excellently Doctoral Paper and HAIPURT. |
| |
| Keywords: | linear recurring sequence feedback with carry shift register l-sequences linear complexity |
| 本文献已被 CNKI 万方数据 SpringerLink 等数据库收录！ |
