Browse > Article

On the Characteristic and Analysis of FCSR Sequences for Linear Complexity  

Seo Chang-Ho (공주대학교 응용수학과)
Kim Seok-Woo (한세대학교 정보보호학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.32, no.10, 2005 , pp. 507-511 More about this Journal
Abstract
We have derived the linear complexity of a binary sequence generated by a Feedback with Carry Shift Regiater(FCSR) under the following condition: q is a power of a prime such that $q=r^e,\;(e{\geq}2)$ and r=2p+1, where both r and p are 2-prime. Also, a summation generator creates sequence from addition with carry of LFSR(Linear Feedback Shift Register) sequences. Similarly, it is possible to generate keystream by bitwise exclusive-oring on two FCSR sequences. In this paper, we described the cryptographic properties of a sequence generated by the FCSRs in view of the linear complexity.
Keywords
FCSR; Linear Complexity;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Hua Loo Keng, Introduction to Number Theory, Springer-Verlag, 1982
2 J. M. Massey, 'Shift-Register Synthesis and BCH Decoding,' IEEE Trans. Info. Theory, VoI.IT-15, pp.122-127, 1969   DOI
3 서창호, 이상진, 김용대, 임종인, 'FCSR의 선형복잡도 하한에 관하여', 통신정보보호학회 논문지, Vol.7, No.4, pp. 127-132, 1997   과학기술학회마을
4 Changho Seo, Sangjin Lee, Yeoulouk Sung, Keunhee Han, Sangchoon Kim, 'A lower bound on the linear span of an FCSR,' IEEE Trans. on Information Theory, Vol.46, No.2, pp.691-693, 2001   DOI   ScienceOn
5 Changho Seo, Sangjin Lee, Yeoulouk Sung, Keunhee Han, Sangchoon Kim, 'A lower bound on the linear span of an FCSR,' IEEE Trans. on Information Theory, Vol.46, No.2, pp.691-693, 2001   DOI   ScienceOn
6 D.E.Kunth, The art of computer Programming, Vol.2: Seminumberical Algorithms, Addison-Wesley, 1981
7 M.Goresky and A.Klapper, 'Feedback Registers based on Ramified Extensions of the 2- Adic Numbers,' Advances in Cryptology-CRYPTO'94, LNCS 950, pp.215-222, 1994   DOI
8 Meier and O.Staffelbach, 'Correlation Properties of combiners with memory in stream ciphers,' Journal of Cryptology, Vol.5, No.1, pp.67-86, 1992   DOI
9 R.A. Rueppel, 'Analysis and Design of Stream Ciphers,' Springer-Verlag, Berlin, Heidelberg, New York, London, Paris, Tokyo, In Communications and Control Engineering Series, 1986
10 W.Meier and O.Staffelbach, 'Fast Correlation Attacks on Certain Stream Ciphers,' Journal of Cryptology, Vol.1, No.3, pp.159-176, 1989   DOI