Multisequences with large linear and k-error linear complexity from Hermitian function fields
IEEE Transactions on Information Theory
Efficient audit service outsourcing for data integrity in clouds
Journal of Systems and Software
Hi-index | 754.90 |
Following the idea of Xing et al., we investigate a general method for constructing families of pseudorandom sequences with low correlation and large linear complexity from elliptic curves over finite fields in this correspondence. With the help of the tool of exponential sums on elliptic curves, we study their periods, linear complexities, linear complexity profiles, distributions of r-patterns, periodic correlation, partial period distributions, and aperiodic correlation in detail. The results show that they have nice randomness.