Please use this identifier to cite or link to this item:
|Title:||Sequences with almost perfect linear complexity profiles and curves over finite fields|
|Authors:||Xing, C. |
|Citation:||Xing, C., Lam, K.Y. (1999). Sequences with almost perfect linear complexity profiles and curves over finite fields. IEEE Transactions on Information Theory 45 (4) : 1267-1270. ScholarBank@NUS Repository. https://doi.org/10.1109/18.761282|
|Abstract:||For stream ciphers, we need to generate pseudorandom sequences which are of properties of unpredictability and randomness. A important measure of unpredictability and randomness is the linear complexity profile (l.c.p.) l a(n) of a sequence a. A sequence a is called almost perfect if the l.c.p. is l a(n) = n/2+O(1). Based on curves over finite fields, we present in this correspondence a method to construct almost perfect sequences. We also illustrate our construction by explicit examples from the projective line and elliptic curves over the binary field.|
|Source Title:||IEEE Transactions on Information Theory|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 22, 2019
WEB OF SCIENCETM
checked on Jan 14, 2019
checked on Dec 15, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.