On the linear complexity of the Naor–Reingold sequence with elliptic curves

doi:10.1016/j.ffa.2010.05.005

Finite Fields and Their Applications

Volume 16, Issue 5, September 2010, Pages 329-333

https://doi.org/10.1016/j.ffa.2010.05.005 Get rights and content

Under an Elsevier user license

open archive

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.

Keywords

Naor–Reingold pseudo-random function

Linear complexity

Elliptic curves