Referenced Items are not available for this document.
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.) la(n) of a sequence a. A sequence a is called almost perfect if the l.c.p. is la(n)=n/2+O(1). Based on curves over finite fields, we present 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
Published in:
Information Theory, IEEE Transactions on
(Volume:45
,
Issue:
4
)
Date of Publication: May 1999
- Page(s):
- 1267 - 1270
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 6255096
- Digital Object Identifier :
- 10.1109/18.761282
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- May 1999
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
