Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Sequences with almost perfect linear complexity profiles and curves over finite fields

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Chaoping Xing ; Sch. of Comput., Nat. Univ. of Singapore, Singapore ; Kwok Yan Lam

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 )