Periodic sequences with maximal linear complexity and almost maximal k-rrror linear complexity

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

Volumn 2898, Issue , 2003, Pages 183-189

  Niederreiter, Harald ^a   Shparlinski, Igor E ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

NP-HARD; NUMBER THEORY;

ADMISSIBLE ERROR; FINITE FIELDS; K ERROR LINEAR COMPLEXITY; LINEAR COMPLEXITY; MAXIMAL K; PERIOD LENGTH; PERIODIC SEQUENCE; STREAM CIPHERS;

ECONOMIC AND SOCIAL EFFECTS;

EID: 35248827019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40974-8_15     Document Type: Article

References (18)

1. R. C. Baker and G. Harman, 'Shifted primes without large prime factors', Acta Arithmetica, 83 (1998), 331-361.
2. T. W. Cusick, C. Ding and A. Renvall, Stream Ciphers and Number Theory, Elsevier, Amsterdam, 1998.
3. C. Ding, G. Xiao and W. Shan, The Stability Theory of Stream Ciphers, Lecture Notes in Comp. Sci., vol. 561, Springer-Verlag, Berlin, 1991.
4. J. B. Friedlander, C. Pomerance and I. E. Shparlinski, 'Period of the power generator and small values of Carmichael's function', Math. Comp., 70 (2001), 1591-1605
5. (see also Math. Comp., 71 (2002), 1803-1806).
6. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Oxford Univ. Press, Oxford, 1979.
7. D. R. Heath-Brown, 'Artin's conjecture for primitive roots', Quart. J. Math., 37 (1986), 27-38.
8. C. Hooley, 'On Artin's conjecture', J. Reine Angew. Math., 225 (1967), 209-220.
9. P. Kurlberg, 'On the order of unimodular matrices modulo integers', Acta Arithmetica, 110 (2003), 141-151.
10. P. Kurlberg and Z. Rudnick, 'On quantum ergodicity for linear maps of the torus', Comm. Math. Phys., 222 (2001), 201-227.
11. S. Li and C. Pomerance, 'On generalizing Artin's conjecture on primitive roots to composite moduli', J. Reine Angew. Math., 556 (2003), 205-224.
12. W. Meidl and H. Niederreiter, 'Periodic sequences with maximal linear complexity and large k-error linear complexity', Appl. Algebra in Engin., Commun. and Computing, (to appear).
13. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, FL, 1996.
14. H. Niederreiter, 'Some computable complexity measures for binary sequences', Sequences and Their Applications (C. Ding, T. Helleseth and H. Niederreiter, eds.), Springer-Verlag, London, 1999, pp. 67-78.
15. H. Niederreiter, 'Periodic sequences with large k-error linear complexity', IEEE Trans. Inform. Theory, 49 (2003), 501-505.
16. R. A. Rueppel, Analysis and Design of Stream Ciphers, Springer-Verlag, Berlin, 1986.
17. R. A. Rueppel, 'Stream ciphers', Contemporary Cryptology: The Science of Information Integrity (G. J. Simmons, ed.), IEEE Press, New York, 1992, pp. 65-134.
18. n,, IEEE Trans. Inform. Theory, 39 (1993), 1398-1401.