Constructions of Sequences with Almost Perfect Linear Complexity Profile from Curves over Finite Fields

Authors:
Chaoping Xing;Harald Niederreiter;Kwok Yan Lam;Cunsheng Ding
Affiliations:
Department of Mathematics, The National University of Singapore, Lower Kent Ridge Road, Singapore, 119260f1E-mail: xingcp@math.nus.edu.sgf1;Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19, A-1010, Vienna, Austriaf2E-mail: niederreiter@oeaw.ac.atf2;School of Computing, The National University of Singapore, Lower Kent Ridge Road, Singapore, 119260f3E-mail: lamky@comp.nus.edu.sg, dingcs@comp.nus.edu.sgf3;School of Computing, The National University of Singapore, Lower Kent Ridge Road, Singapore, 119260f3E-mail: lamky@comp.nus.edu.sg, dingcs@comp.nus.edu.sgf3
Venue:
Finite Fields and Their Applications
Year:
1999

Citing 4
Cited 0

Analysis and design of stream ciphers

Analysis and design of stream ciphers
Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles

Journal of Complexity
Sequences with almost perfect linear complexity profile

EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Sequences with almost perfect linear complexity profiles and curves over finite fields

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequences with almost perfect linear complexity profile are of importance for the linear complexity theory of sequences. In this paper we present several constructions of sequences with almost perfect linear complexity profile based on algebraic curves over finite fields. Moreover, some interesting consequences and examples are derived from our constructions.