Abstract
An efficient algorithm for determining the linear complexity and the minimal polynomial of sequence with period p m q n over a finite field GF(q) is designed, where p andq are primes, and q is a primitive root modulo p 2. The new algorithm generalizes the algorithm for computing the linear complexity of sequences with period q n over GF(q) and that for computing the linear complexity of sequences with period p m over GF(q).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Massey, J.L.: Shift register synthesis and BCH decoding. IEEE Trans. on Inform. Theory. 15(1), 122–127 (1969)
Games, R.A., Chan, A.H.: A fast algorithm for determining the complexity of a binary sequence with period 2n. IEEE Trans on Inform. Theory 29(1), 144–146 (1983)
Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. In: Ding, C., Shan, W., Xiao, G. (eds.) The Stability Theory of Stream Ciphers. LNCS, vol. 561, Springer, Heidelberg (1991)
Xiao, G., Wei, S., Lam, K.Y., Imamura, K.: A fast algorithm for determining the linear complexity of a sequence with period p n over GF(q). IEEE Trans. on Inform. Theory 46(6), 2203–2206 (2000)
Wei, S., Xiao, G., Chen, Z.: A fast algorithm for determining the linear complexity of a binary sequence with period 2n p m. Science in China(Series F) 44(6), 453–460 (2001)
Wei, S., Xiao, G., Chen, Z.: a fast algorithm for determining the minimal polynomial of a sequence with period 2p n over GF(q). IEEE Trans. on Inform. Theory 48(10), 2754–2758 (2002)
McEliece, R.J.: Finite Fields for Computer Scientists and Engineers. Kluwer Academic, Boston (1987)
Rosen, K.H.: Elementary Number Theory and Its Applications. Addision-Wesley, Reading (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, S., Chen, G., Xiao, G. (2005). A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences. In: Feng, D., Lin, D., Yung, M. (eds) Information Security and Cryptology. CISC 2005. Lecture Notes in Computer Science, vol 3822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599548_17
Download citation
DOI: https://doi.org/10.1007/11599548_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30855-3
Online ISBN: 978-3-540-32424-9
eBook Packages: Computer ScienceComputer Science (R0)