Design and study of a strong crypto-system model for e-Commerce
ICCC '02 Proceedings of the 15th international conference on Computer communication
Multi-sequences with d-perfect property
Journal of Complexity
Multisequences with large linear and k-error linear complexity from Hermitian function fields
IEEE Transactions on Information Theory
A novel complexity metric of FH/SS sequences using approximate entropy
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Complexity measure of FH/SS sequences using approximate entropy
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Finite Fields and Their Applications
| Hi-index | 754.90 |
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