TY - JOUR
T1 - On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves
AU - Shparlinski, Igor E.
AU - Silverman, Joseph H.
PY - 2001/12
Y1 - 2001/12
N2 - We show that the elliptic curve analogue of the pseudo-random number function, introduced recently by M. Naor and O. Reingold, produces a sequence with large linear complexity. This result generalizes a similar result of F. Griffin and I. E. Shparlinski for the linear complexity of the original function of M. Naor and O. Reingold. The proof is based on some results about the distribution of subset-products in finite fields and some properties of division polynomials of elliptic curves.
AB - We show that the elliptic curve analogue of the pseudo-random number function, introduced recently by M. Naor and O. Reingold, produces a sequence with large linear complexity. This result generalizes a similar result of F. Griffin and I. E. Shparlinski for the linear complexity of the original function of M. Naor and O. Reingold. The proof is based on some results about the distribution of subset-products in finite fields and some properties of division polynomials of elliptic curves.
UR - http://www.scopus.com/inward/record.url?scp=0035546532&partnerID=8YFLogxK
U2 - 10.1023/A:1011223204345
DO - 10.1023/A:1011223204345
M3 - Article
AN - SCOPUS:0035546532
VL - 24
SP - 279
EP - 289
JO - Designs, Codes and Cryptography
JF - Designs, Codes and Cryptography
SN - 0925-1022
IS - 3
ER -