Sequences with almost perfect linear complexity profiles and curves over finite fields

IEEE Transactions on Information Theory

Volumn 45, Issue 4, 1999, Pages 1267-1270

  Xing, Chaoping ^a   Lam, Kwok Yan ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES; THEOREM PROVING;

LINEAR COMPLEXITY;

LINEAR PROGRAMMING;

EID: 0032673264     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.761282     Document Type: Article

References (5)

1. H. Niederreiter Sequences with almsot perfect linear complexity profile," in Advances in Cryptology-EUROCRYPT'87, D. Chaumand and W. L. Price, Eds., Lecture Notes in Computer Science, vol. 330. Berlin, Germany: Springer-Verlag, 1988, pp. 37-51.
2. H. Niederreiter and M. Vielhaber Linear complexity profiles: Hausdorff dimension for almost perfect profiles and Measures for general profiles," J. Complexity, vol. 13, pp. 353-383, 1997.
3. R. A. Rueppel, Analysis and Design of Stream Ciphers. Berlin, Germany: Springer-Verlag, 1986.
4. _ Stream ciphers," in Contemporary Cryptology-The Science of Information Integrity, G. J. Simmons, Ed. New York: IEEE Press, 1992, pp. 65-134.
5. H. Stichtenoth, Algebraic Function Fields and Codes. Berlin, Germany: Springer-Verlag, 1993.