Linear complexity and related complexity measures for sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2904, Issue , 2003, Pages 1-17

  Niederreiter, Harald ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COMPLEXITY MEASURES; JOINT LINEAR COMPLEXITY; K ERROR LINEAR COMPLEXITY; LINEAR COMPLEXITY; LINEAR COMPLEXITY PROFILE; MULTI-SEQUENCES; STREAM CIPHERS;

COMPUTATIONAL COMPLEXITY;

EID: 0347526104     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24582-7_1     Document Type: Article

References (67)

1. V.B. Balakirsky, Description of binary sequences based on the interval linear complexity profile, Sequences and Their Applications - SETA '01 (T. Helleseth, P.V. Kumar, and K. Yang, eds.), pp. 101-115, Springer, London, 2002.
2. V. Berthé and H. Nakada, On continued fraction expansions in positive characteristic: equivalence relations and some metric properties, Expositions Math. 18, 257-284 (2000).
3. P. Caballero-Gil, Regular cosets and upper bounds on the linear complexity of certain sequences, Sequences and Their Applications (C. Ding, T. Helleseth, and H. Niederreiter, eds.), pp. 161-170, Springer, London, 1999.
4. P. Caballero-Gil, New upper bounds on the linear complexity, Comput. Math. Appl. 39, no. 3-4, 31-38 (2000).
5. G. Carter, Enumeration results on linear complexity profiles, Cryptography and Coding II (C. Mitchell, ed.), pp. 23-34, Oxford University Press, Oxford, 1992.
6. T.W. Cusick, C. Ding, and A. Renvall, Stream Ciphers and Number Theory, Elsevier, Amsterdam, 1998.
7. Z.D. Dai and K. Imamura, Linear complexity of one-symbol substitution of a periodic sequence over GF(q), IEEE Trans. Inform. Theory 44, 1328-1331 (1998).
8. E. Dawson and L. Simpson, Analysis and design issues for synchronous stream ciphers, Coding Theory and Cryptology (H. Niederreiter, ed.), pp. 49-90, World Scientific, Singapore, 2002.
9. C. Ding, Binary cyclotomic generators, Fast Software Encryption (Leuven, 1994), Lecture Notes in Computer Science, Vol. 1008, pp. 29-60, Springer, Berlin, 1995.
10. C. Ding, G. Xiao, and W. Shan, The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science, Vol. 561, Springer, Berlin, 1991.
11. G. Dorfer and A. Winterhof, Lattice structure and linear complexity profile of nonlinear pseudorandom number generators, Applicable Algebra Engrg. Comm. Comput. 13, 499-508 (2003).
12. G. Dorfer and A. Winterhof, Lattice structure of nonlinear pseudorandom number generators in parts of the period, Monte Carlo and Quasi-Monte Carlo Methods 2002 (H. Niederreiter, ed.), Springer, Berlin, to appear.
13. H.J. Fell, Linear complexity of transformed sequences, Eurocode '90 (Udine, 1990), Lecture Notes in Computer Science, Vol. 514, pp. 205-214, Springer, Berlin, 1991.
14. L.J. Garcia-Villalba and A. Fúster-Sabater, On the linear complexity of the sequences generated by nonlinear filterings, Inform. Process. Lett. 76, no. 1-2, 67-73 (2000).
15. F. Griffin and I.E. Shparlinski, On the linear complexity profile of the power generator, IEEE Trans. Inform. Theory 46, 2159-2162 (2000).
16. F.G. Gustavson, Analysis of the Berlekamp-Massey linear feedback shift-register synthesis algorithm, IBM J. Res. Develop. 20, 204-212 (1976).
17. J. Gutierrez, I.E. Shparlinski, and A. Winterhof, On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators, IEEE Trans. Inform. Theory 49, 60-64 (2003).
18. P. Hawkes and G.G. Rose, Exploiting multiples of the connection polynomial in word-oriented stream ciphers, Advances in Cryptology - ASIACRYPT 2000 (T. Okamoto, ed.), Lecture Notes in Computer Science, Vol. 1976, pp. 303-316, Springer, Berlin, 2000.
19. p and trace representation of Lempel-Cohn-Eastman sequences, IEEE Trans. Inform. Theory 49, 1548-1552 (2003).
20. A.E.D. Houston, Densities of perfect linear complexity profile binary sequences, Applications of Combinatorial Mathematics (Oxford, 1994), IMA Conference Series, Vol. 60, pp. 119-133, Oxford University Press, Oxford, 1997.
21. A.E.D. Houston, On the limit of maximal density of sequences with a perfect linear complexity profile, Designs Codes Cryptogr. 10, 351-359 (1997).
22. S. Jiang, Z.D. Dai, and K. Imamura, Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting κ symbols within one period, IEEE Trans. Inform. Theory 46, 1174-1177 (2000).
23. D. Jungnickel, Finite Fields: Structure and Arithmetics, Bibliographisches Institut, Mannheim, 1993.
24. n, p a prime, Inform. and Comput. 151, 134-147 (1999).
25. n, Sequences and Their Applications - SETA '01 (T. Helleseth, P.V. Kumar, and K. Yang, eds.), pp. 218-227, Springer, London, 2002.
26. D. Kohel, S. Ling, and C.P. Xing, Explicit sequence expansions, Sequences and Their Applications (C. Ding, T. Helleseth, and H. Niederreiter, eds.), pp. 308-317, Springer, London, 1999.
27. N. Kolokotronis, P. Rizomiliotis, and N. Kalouptsidis, First-order optimal approximation of binary sequences, Sequences and Their Applications - SETA '01 (T. Helleseth, P.V. Kumar, and K. Yang, eds.), pp. 242-256, Springer, London, 2002.
28. N. Kolokotronis, P. Rizomiliotis, and N. Kalouptsidis, Mimimum linear span approximation of binary sequences, IEEE Trans. Inform. Theory 48, 2758-2764 (2002).
29. S. Konyagin, T. Lange, and I.E. Shparlinski, Linear complexity of the discrete logarithm, Designs Codes Cryptogr. 28, 135-146 (2003).
30. K. Kurosawa, F. Sato, T. Sakata, and W. Kishimoto, A relationship between linear complexity and κ-error linear complexity, IEEE Trans. Inform. Theory 46, 694-698 (2000).
31. n, IEEE Trans. Inform. Theory 49, 273-280 (2003).
32. R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, Cambridge, 1997.
33. J.L. Massey and S. Serconek, Linear complexity of periodic sequences: a general theory, Advances in Cryptology - CRYPTO '96 (N. Koblitz, ed.), Lecture Notes in Computer Science, Vol. 1109, pp. 358-371, Springer, Berlin, 1996.
34. W. Meidl and H. Niederreiter, Linear complexity, κ-error linear complexity, and the discrete Fourier transform, J. Complexity 18, 87-103 (2002).
35. W. Meidl and H. Niederreiter, Counting functions and expected values for the κ-error linear complexity, Finite Fields Appl. 8, 142-154 (2002).
36. W. Meidl and H. Niederreiter, On the expected value of the linear complexity and the κ-error linear complexity of periodic sequences, IEEE Trans. Inform. Theory 48, 2817-2825 (2002).
37. W. Meidl and H. Niederreiter, The expected value of the joint linear complexity of periodic multisequences, J. Complexity 19, 61-72 (2003).
38. W. Meidl and H. Niederreiter, Periodic sequences with maximal linear complexity and large κ-error linear complexity, Applicable Algebra Engrg. Comm. Comput., to appear.
39. W. Meidl and A. Winterhof, Lower bounds on the linear complexity of the discrete logarithm in finite fields, IEEE Trans. Inform. Theory 47, 2807-2811 (2001).
40. W. Meidl and A. Winterhof, On the linear complexity profile of explicit nonlinear pseudorandom numbers, Inform. Process. Lett. 85, 13-18 (2003).
41. H. Niederreiter, The probabilistic theory of linear complexity, Advances in Cryptology - EUROCRYPT '88 (C.G. Günther, ed.), Lecture Notes in Computer Science, Vol. 330, pp. 191-209, Springer, Berlin, 1988.
42. H. Niederreiter, Finite fields and cryptology, Finite Fields, Coding Theory, and Advances in Communications and Computing (G.L. Mullen and P.J.-S. Shiue, eds.), pp. 359-373, Dekker, New York, 1993.
43. H. Niederreiter, Some computable complexity measures for binary sequences, Sequences and Their Applications (C. Ding, T. Helleseth, and H. Niederreiter, eds.), pp. 67-78, Springer, London, 1999.
44. H. Niederreiter, Periodic sequences with large κ-error linear complexity, IEEE Trans. Inform. Theory 49, 501-505 (2003).
45. H. Niederreiter and H. Paschinger, Counting functions and expected values in the stability theory of stream ciphers, Sequences and Their Applications (C. Ding, T. Helleseth, and H. Niederreiter, eds.), pp. 318-329, Springer, London, 1999.
46. H. Niederreiter and I.E. Shparlinski, Periodic sequences with maximal linear complexity and almost maximal κ-error linear complexity, Cryptography and Coding (Cirencester, 2003), Lecture Notes in Computer Science, Springer, Berlin, to appear.
47. H. Niederreiter and M. Vielhaber, Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles, J. Complexity 13, 353-383 (1997).
48. H. Niederreiter and M. Vielhaber, An algorithm for shifted continued fraction expansions in parallel linear time, Theoretical Computer Science 226, 93-104 (1999).
49. H. Niederreiter and A. Winterhof, Lattice structure and linear complexity of nonlinear pseudorandom numbers, Applicable Algebra Engrg. Comm. Comput. 13, 319-326 (2002).
50. H. Niederreiter and C.P. Xing, National Points on Curves over Finite Fields: Theory and Applications, London Math. Soc. Lecture Note Series, Vol. 285, Cambridge University Press, Cambridge, 2001.
51. R.A. Rueppel, Analysis and Design of Stream Ciphers, Springer, Berlin, 1986.
52. R.A. Rueppel, Stream ciphers, Contemporary Cryptology: The Science of Information Integrity (G.J. Simmons, ed.), pp. 65-134, IEEE Press, New York, 1992.
53. I.E. Shparlinski, Number Theoretic Methods in Cryptography: Complexity Lower Bounds, Birkhäuser, Basel, 1999.
54. I.E. Shparlinski, Linear complexity of the Naor-Reingold pseudo-random function, Inform. Process. Lett. 76, no. 3, 95-99 (2000).
55. I.E. Shparlinski, On the linear complexity of the power generator, Designs Codes Cryptogr. 23, 5-10 (2001).
56. I.E. Shparlinski, Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness, Birkhäuser, Basel, 2003.
57. I.E. Shparlinski and J.H. Silverman, On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves, Designs Codes Cryptogr. 24, 279-289 (2001).
58. n, IEEE Trans. Inform. Theory 39, 1398-1401 (1993).
59. C.H. Tan, Period and linear complexity of cascaded clock-controlled generators, Sequences and Their Applications (C. Ding, T. Helleseth, and H. Niederreiter, eds.), pp. 371-378, Springer, London, 1999.
60. G. Xiao and S. Wei, Fast algorithms for determining the linear complexity of period sequences, Progress in Cryptology - INDOCRYPT 2002 (A. Menezes and P. Sarkar, eds.), Lecture Notes in Computer Science, Vol. 2551, pp. 12-21, Springer, Berlin, 2002.
61. C.P. Xing, Multi-sequences with almost perfect linear complexity profile and function fields over finite fields, J. Complexity 16, 661-675 (2000).
62. C.P. Xing, Applications of algebraic curves to constructions of sequences, Cryptography and Computational Number Theory (K.Y. Lam et al., eds.), pp. 137-146, Birkhäuser, Basel, 2001.
63. C.P. Xing, Constructions of sequences from algebraic curves over finite fields, Sequences and Their Applications - SETA '01 (T. Helleseth, P.V. Kumar, and K. Yang, eds.), pp. 88-100, Springer, London, 2002.
64. C.P. Xing and K.Y. Lam, Sequences with almost perfect linear complexity profiles and curves over finite fields, IEEE Trans. Inform. Theory 45, 1267-1270 (1999).
65. C.P. Xing, K.Y. Lam, and Z.H. Wei, A class of explicit perfect multi-sequences, Advances in Cryptology - ASIACRYPT '99 (K.Y. Lam, E. Okamoto, and C.P. Xing, eds.), Lecture Notes in Computer Science, Vol. 1716, pp. 299-305, Springer, Berlin, 1999.
66. C.P. Xing and H. Niederreiter, Applications of algebraic curves to constructions of codes and almost perfect sequences, Finite Fields and Applications (D. Jungnickel and H. Niederreiter, eds.), pp. 475-489, Springer, Berlin, 2001.
67. C.P. Xing, H. Niederreiter, K.Y. Lam, and C. Ding, Constructions of sequences with almost perfect linear complexity profile from curves over finite fields, Finite Fields Appl. 5, 301-313 (1999).