ON THE LINEAR COMPLEXITY OF FCSR SEQUENCES 被引量：2

ON THE LINEAR COMPLEXITY OF FCSR SEQUENCES

下载PDF

导出

摘要 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 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.

作者 Qi Wenfeng Xu HongDept of Appl.Math,Zhengzhou Information Engineering Univ., Zhengzhou 450002,China

出处《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2003年第3期318-324,共7页 高校应用数学学报（英文版）（B辑）

基金 The work is supported by the Special Fund of National Excellently Doctoral Paper and HAIPURT.

关键词 linear recurring sequence feedback with carry shift register l-sequences linear complexity linear recurring sequence,feedback with carry shift register,l-sequences,linear complexity

分类号 O211.5 [理学—概率论与数理统计]

引文网络
相关文献

参考文献8

1Klapper, A. , Goresky, M. , 2-adic shift registers, Fast Software Encryption LNCS 809, New York.Springer Verlag, 1994,174-178.
2Klapper, A. , Goresky, M. , Large period nearly deBrujin FCSR sequences, Advances in Cryptology-Eurocrypt 1995 ,LNCS 921 ,New York :Springer Verlag, 1995,263-273.
3Klapper A., Goresky M., Feedback shift registers, 2-adic span, and combiners with memory, J.Cryptology, 1997,10: 111-147.
4Klapper A. , Goresky M. , Arithmetic cross-correlation of FCSR Sequences, IEEE Trans. Infom Theory,1997,36:842-846.
5Goresky,M. ,Klapper A. ,Fourier transforms and the 2-adic span of periodic binary sequences,IEEE Trans. Infom. Theory, 2000,46 (2) : 687-691.
6Rueppel ,R. ,Analysis and Design of Stream Ciphers ,New York:Springer Verlag,1986.
7Seo,C. ,LEE,S. ,Sung,Y. ,et al. ,A lower bound on the linear span of an FCSR,IEEE Trans. Infom.Theory, 2000,46 (2) : 691-693.
8Lidl, R., Niederreiter, H., Finite Fields, Encyclopaedia of mathematics and its applications 20,Combridge ,Cambridge University Press, 1983.

同被引文献2

1戚文峰,周锦君.Distribution of 0 and 1 in the highest level of primitive sequences over Z/(2~e)[J].Science China Mathematics,1997,40(6):606-611. 被引量：4
2魏仕民,陈钟,肖国镇.确定周期为2~np^m二元序列线性复杂度的快速算法[J].中国科学（E辑）,2002,32(3):401-408. 被引量：9

引证文献2

1陈兰芳,戚文峰.周期为2~mp^n的二元序列的2-adic复杂度[J].通信学报,2005,26(6):6-10. 被引量：1
2许丹丹,朱伟浩,豆亚芳.环Z/(2^(29)-1)上本原序列的密码性质分析及其高效并行设计实现[J].信息工程大学学报,2023,24(6):725-733.

二级引证文献1

1董丽华,胡予濮.确定GF（qm）上周期为2n的二元序列的2-adic复杂度的快速算法[J].电子学报,2007,35(B12):18-21.

1马燕飞,谷京朝,郁成军.FCSR原理及其VHDL语言的实现[J].现代电子技术,2005,28(3):66-68.
2邢朝平,肖国镇,冯克勤.M序列一个周期的复杂度[J].应用数学学报,1991,14(2):257-261.
3王旭峰,李超.进位移位寄存器序列的密码学性质[J].计算机工程与科学,2005,27(2):45-46.
4华建国,徐正全,范亚芹.P2P环境下一种新的移动组播密钥管理方案[J].吉林大学学报（信息科学版）,2008,26(2):206-212.
5王宏伟,葛武.Linear Complexity of New Generalized Cyclotomic Sequences of Length 2pq[J].Transactions of Nanjing University of Aeronautics and Astronautics,2014,31(6):710-716.
6Ji-Zan Zhang,Zhi-Min Gu,Ming-Quan Zhang.Reducing the Upper Bound Delay by Optimizing Bank-to-Core Mapping[J].Journal of Computer Science & Technology,2016,31(6):1179-1193.
7王中孝,戚文峰.Galois FCSR进位分布研究[J].信息工程大学学报,2010,11(2):147-151.
8Shao Fang HONG Wei CAOMathematical College, Sichuan University, Chengdu 610064, P. R. China.Notes on the Borwein-Choi Conjecture of Littlewood Cyclotomic Polynomials[J].Acta Mathematica Sinica,English Series,2009,25(1):65-76.
9赵培,赵景琰,金鹰翰,赵颖,王进祥.一种新型序列密码的设计与实现[J].微处理机,2010,31(3):21-24. 被引量：1
10薛帅,戚文峰.d-FCSR记忆状态分析[J].信息工程大学学报,2007,8(4):388-390.

Applied Mathematics(A Journal of Chinese Universities)

2003年第3期

浏览历史

内容加载中请稍等...

ON THE LINEAR COMPLEXITY OF FCSR SEQUENCES 被引量：2

参考文献8

同被引文献2

引证文献2

二级引证文献1

相关作者

相关机构

相关主题

浏览历史