Abstract: The Naor-Reingold sequences with elliptic curves are used in cryptography due to their nice construction and good theoretical properties. Here we provide a new bound on the linear complexity of these sequences. Our result improves the previous one obtained by I.E. Shparlinski and J.H. Silverman and holds in more cases.

Authorship

Download reference