Please use this identifier to cite or link to this item: https://doi.org/10.1109/18.761282
DC FieldValue
dc.titleSequences with almost perfect linear complexity profiles and curves over finite fields
dc.contributor.authorXing, C.
dc.contributor.authorLam, K.Y.
dc.date.accessioned2013-07-23T09:23:15Z
dc.date.available2013-07-23T09:23:15Z
dc.date.issued1999
dc.identifier.citationXing, 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.issn00189448
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/43037
dc.description.abstractFor 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.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/18.761282
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1109/18.761282
dc.description.sourcetitleIEEE Transactions on Information Theory
dc.description.volume45
dc.description.issue4
dc.description.page1267-1270
dc.description.codenIETTA
dc.identifier.isiut000080037500024
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.