Search

Searching. Please wait…

Detalle_Publicacion

On the linear complexity of the Naor-Reingold sequence

Abstract: We obtain a lower bound on the linear complexity of the Naor?Reingold sequence. This result solves an open problem proposed by Igor Shparlinski and improves known results in some cases.

 Authorship: Gómez D., Gutierrez J., Ibeas A.,

 Fuente: Information Processing Letters, 2011, 111(17), 854-856

Publisher: Elsevier

 Publication date: 15/09/2011

No. of pages: 3

Publication type: Article

 DOI: 10.1016/j.ipl.2011.05.017

ISSN: 0020-0190,1872-6119

 Spanish project: MTM2007-67088

Publication Url: https://doi.org/10.1016/j.ipl.2011.05.017

Authorship

ALVAR JESUS IBEAS MARTIN