Please use this identifier to cite or link to this item:
https://doi.org/10.1109/18.761282
DC Field | Value | |
---|---|---|
dc.title | Sequences with almost perfect linear complexity profiles and curves over finite fields | |
dc.contributor.author | Xing, C. | |
dc.contributor.author | Lam, K.Y. | |
dc.date.accessioned | 2013-07-23T09:23:15Z | |
dc.date.available | 2013-07-23T09:23:15Z | |
dc.date.issued | 1999 | |
dc.identifier.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 | |
dc.identifier.issn | 00189448 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/43037 | |
dc.description.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. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/18.761282 | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.contributor.department | MATHEMATICS | |
dc.description.doi | 10.1109/18.761282 | |
dc.description.sourcetitle | IEEE Transactions on Information Theory | |
dc.description.volume | 45 | |
dc.description.issue | 4 | |
dc.description.page | 1267-1270 | |
dc.description.coden | IETTA | |
dc.identifier.isiut | 000080037500024 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.