A class of explicit perfect multi-sequences

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

Volumn 1716, Issue , 1999, Pages 299-305

  Xing, Chaoping ^a   Lam, Kwok Yan ^a   Wei, Zhenghong ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b School of Computing National University of Singapore ^*  (China)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

FINITE FIELDS; FUNCTION FIELDS; MULTI-SEQUENCES;

RATIONAL FUNCTIONS;

EID: 84956860778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48000-6_24     Document Type: Conference Paper

References (8)

1. C. S. Ding, “Proof of Massey’s conjectured algorithm,” in Advances in Cryptology - Eurocrypt’88, C. G. Guenther ed., Springer-Verlag, Berlin, LNCS Vol. 310, 1988, pp.345-349. 299
2. D. R. Kohel, S. Ling and C. P. Xing, “Explicit sequence expansions,” to appear in DMTC, Springer-Verlag.
3. H. Niederreiter, “Sequences with almsot perfect linear complexity profile,” in Advances in Cryptology–EUROCRYPT’87, D. Chaumand and W. L. Price, eds., Springer-Verlag, Berlin: LNCS, Vol. 304, 1988, pp. 37-51.
4. R. A. Rueppel, Analysis and Design of Stream Ciphers, Berlin: Springer-Verlag, 1986.
5. R. A. Rueppel, “Stream ciphers,” in Contemporary Cryptology–The Science of Information Integrity, G. J. Simmons, Ed., IEEE Press, New York: 1992, pp. 65-134.
6. H. Stichtenoth, Algebraic Function Fields and Codes, Berlin: Springer-Verlag, 1993.
7. C. P. Xing, “Perfect multi-sequences and function fields over finite fields”, Preprint, 1999.
8. C. P. Xing and K. Y. Lam, “Sequences with almost perfect linear complexity profiles and curves over finite fields,” IEEE Trans. Inform. Theory, vol. IT-45, 1999, pp.1267-1270.