Abstract
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p n over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p 2; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p mqn over GF(q), the other is the algorithm for determining the k-error linear complexity of a sequence with period p n over GF(q), where p is an odd prime, q is a prime and a primitive root modulo p 2. The algorithm for determining the linear complexity and the minimal polynomial of a sequence with period 2p n over GF(q) is also introduced. where p and q are odd prime, and q is a primitive root (mod p 2). These algorithms uses the fact that in these case the factorization of x N—1 is especially simple for N= p n, 2p n, p nqm.
The work was supported in part by 973 Project(G1999035804) and the Natural Science Foundation of China under Grant 60172015 and 60073051.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addision-Wesley, 1974.
S. R. Blackburn, “A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence”, IEEE Trans. Inform. Theory, Vol. 40, pp. 1702–1704, 1994.
S. R. Blackburn, “Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences”, IEEE Trans. Inform. Theory, Vol. 43, pp. 537–548, 1997.
C. Ding, G. Xiao and W. Shan, The stability theory of stream ciphers, Springer-Verlag, Berlin Heidelberg, 1991.
R. A. Games, A. H. Chan, “A fast algorithm for determining the complexity of a binary sequence with period 2n”, IEEE Trans. Inform. Theory, vol. 29, pp. 144–146, 1983.
K. Ireland and M. Rosen, A classical introduction to modern number theory, Graduate Texts in Mathematics No. 84, Springer, New York, 1982.
T. Kaida, S. Uehara and K. Imamura, “An algorithm for the k-error linear complexity of sequences over GF(p m) with period p n, p a prime”, Information and Computation, Vol. 151, pp.134–147, 1999.
R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley Publishing Company, 1983.
J. L. Massay, “Shift-register synthesis and BCH decoding”, IEEE Trans. Inform. Theory, Vol. 15, pp. 122–127, 1969.
R. J. McEliece, Finite fields for computer scientists and engineers, Kluwer Academic Publishers, 1987.
K. H. Rosen, Elementary number theory and its applications, Addison-Wesley Publishing Company, 1988.
M. Stamp, C. F. Martin, “An algorithm for k-error linear complexity of binary sequences with period 2 n”, IEEE Trans on Inform. Theory, vol. 39, pp. 1398–1401, 1993.
S. Wei, An efficient algorithm for the linear complexity of a class of periodic sequences, Proceeding of ChinaCrypto’2002, Publishing House of Electronics Industry, Beijing, 2002.
S. Wei, Z. Chen and G. Xiao, A fast algorithm for k-error linear complexity of a binary sequence. 2001 International Conferences on Info-tech and Info-net Proceedings, IEEE Press, 2001, No Conferences E, 152–157.
S. Wei, G. Xiao and Z. Chen, A Fast Algorithm for Determining the Minimal Polynomial of a Sequence with Period 2p n over GF(q) IEEE Trans. On Information Theory, 2002, 48(9). (to appear)
S. Wei, G. Xiao and Z. Chen, An Efficient Algorithm for k-Error Linear Complexity. Chinese Journal of Electronics 2002 11( 2):265–267.
S. Wei, G. Xiao and Z. Chen, A fast algorithm for determining the linear complexity of a binary sequence with period 2npm, Science in China, Series F, 2001, 44(6):453–460.
G. Xiao, S. Wei, K. Imamura and K.Y. Lam, Algorithms for Determingning the Liner complexity Proceeding of International workshop on Cryptographic and-Commerce (CrypTEC’99), July 1999,Hong Kong, 31–36.
G. Xiao, S. Wei, K.Y. Lam, and K. Imamura, “A fast algorithms for determining the linear complexity of a sequence with period p n over GF (q)”, IEEE Trans. Inform. Theory, 2000, 46(6): 2203–2206.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, G., Wei, S. (2002). Fast Algorithms for Determining the Linear Complexity of Period Sequences. In: Menezes, A., Sarkar, P. (eds) Progress in Cryptology — INDOCRYPT 2002. INDOCRYPT 2002. Lecture Notes in Computer Science, vol 2551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36231-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-36231-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00263-5
Online ISBN: 978-3-540-36231-9
eBook Packages: Springer Book Archive