Periodic sequences with large k-error linear complexity

IEEE Transactions on Information Theory

Volumn 49, Issue 2, 2003, Pages 501-505

  Niederreiter, Harald ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Cyclotomy; k error linear complexity; Linear complexity; Periodic sequences; Sphere complexity; Stream ciphers

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; THEOREM PROVING;

PERIODIC SEQUENCES;

BINARY SEQUENCES;

EID: 0037321658     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.807308     Document Type: Article

References (21)

1. T. W. Cusick, C. Ding, and A. Renvall, Stream Ciphers and Number Theory. Amsterdam, The Netherlands: North-Holland, 1998.
2. C. Ding, G. Xiao, and W. Shan, The Stability Theory of Stream Ciphers (Lecture Notes in Computer Science). Berlin: Springer-Verlag, 1991, vol. 561.
3. H. J. Fell, "Linear complexity of transformed sequences," in Eurocode '90 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1991, vol. 514, pp. 205-214.
4. C. Hooley, "On Artin's conjecture," J. Reine Angew. Math., vol. 225, pp. 209-220, 1967.
5. n, p a prime," Inform. Comput., vol. 151, pp. 134-147, 1999.
6. n," in Sequences and Their Applications, C. Ding, T. Helleseth, and H. Niederreiter, Eds. London, U.K.: Springer, 1999, pp. 284-296.
7. n," in Sequences and Their Applications SETA '01, T. Helleseth, P. V. Kumar, and K. Yang, Eds. London, U.K.: Springer, 2002, pp. 218-227.
8. N. Kolokotronis, P. Rizomiliotis, and N. Kalouptsidis, "First-order optimal approximation of binary sequences," in Sequences and Their Applications - SETA '01, T. Helleseth, P. V. Kumar, and K. Yang, Eds. London, U.K.: Springer, 2002, pp. 242-256.
9. K. Kurosawa, F. Sato, T. Sakata, and W. Kishimoto, "A relationship between linear complexity and k-error linear complexity," IEEE Trans. Inform. Theory, vol. 46, pp. 694-698, Mar. 2000.
10. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison-Wesley, 1983, now distributed by Cambridge Univ. Press.
11. W. Meidl and H. Niederreiter, "Counting functions and expected values for the k-error linear complexity," Finite Fields Appl., vol. 8, pp. 142-154, 2002.
12. _, "Linear complexity, k-error linear complexity, and the discrete Fourier transform," J. Complexity, vol. 18, pp. 87-103, 2002.
13. _, "On the expected value of the linear complexity and the k-error linear complexity of periodic sequences," IEEE Trans. Inform. Theory, vol. 48, pp. 2817-2825, Nov. 2002.
14. H. Niederreiter, "Some computable complexity measures for binary sequences," in Sequences and Their Applications, C. Ding, T. Helleseth, and H. Niederreiter, Eds. London, U.K.: Springer, 1999, pp. 67-78.
15. H. Niederreiter and H. Paschinger, "Counting functions and expected values in the stability theory of stream ciphers," in Sequences and Their Applications, C. Ding, T. Helleseth, and H. Niederreiter, Eds. London, U.K.: Springer, 1999, pp. 318-329.
16. F. Pappalardi, "On the order of finitely generated subgroups of ℚ* (modp) and divisors of p - 1," J. Number Theory, vol. 57, pp. 207-222, 1996.
17. V. Pless, Introduction to the Theory of Error-Correcting Codes, 2nd ed. New York: Wiley, 1989.
18. R. A. Rueppel, Analysis and Design of Stream Ciphers. Berlin, Germany: Springer-Verlag, 1986.
19. _, "Stream ciphers," in Contemporary Cryptology: The Science of Information Integrity, G. J. Simmons, Ed. New York: IEEE Press, 1992, pp. 65-134.
20. I. E. Shparlinski, Finite Fields: Theory and Computation. Dordrecht, The Netherlands: Kluwer, 1999.
21. n," IEEE Trans. Inform. Theory, vol. 39, pp. 1398-1401, July 1993.