Linear complexity of the Naor-Reingold pseudo-random function

Igor E. Shparlinski

doi:10.1016/S0020-0190(00)00133-2

Linear complexity of the Naor-Reingold pseudo-random function

Igor E. Shparlinski

School of Computing

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

An exponential lower bound on the linear complexity of the pseudo-random function is investigated. This bound is an improvement of the lower bound on the linear complexity of this function from the Griffin-Shparlinski theory.

Original language	English
Pages (from-to)	95-99
Number of pages	5
Journal	Information Processing Letters
Volume	76
Issue number	3
DOIs	https://doi.org/10.1016/S0020-0190(00)00133-2
Publication status	Published - 15 Dec 2000

Access to Document

10.1016/S0020-0190(00)00133-2

Cite this

@article{80d992ce95ba4820a371b17b42e4752d,

title = "Linear complexity of the Naor-Reingold pseudo-random function",

abstract = "An exponential lower bound on the linear complexity of the pseudo-random function is investigated. This bound is an improvement of the lower bound on the linear complexity of this function from the Griffin-Shparlinski theory.",

author = "Shparlinski, {Igor E.}",

year = "2000",

month = dec,

day = "15",

doi = "10.1016/S0020-0190(00)00133-2",

language = "English",

volume = "76",

pages = "95--99",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Linear complexity of the Naor-Reingold pseudo-random function

AU - Shparlinski, Igor E.

PY - 2000/12/15

Y1 - 2000/12/15

N2 - An exponential lower bound on the linear complexity of the pseudo-random function is investigated. This bound is an improvement of the lower bound on the linear complexity of this function from the Griffin-Shparlinski theory.

AB - An exponential lower bound on the linear complexity of the pseudo-random function is investigated. This bound is an improvement of the lower bound on the linear complexity of this function from the Griffin-Shparlinski theory.

UR - http://www.scopus.com/inward/record.url?scp=0034546183&partnerID=8YFLogxK

U2 - 10.1016/S0020-0190(00)00133-2

DO - 10.1016/S0020-0190(00)00133-2

M3 - Article

AN - SCOPUS:0034546183

SN - 0020-0190

VL - 76

SP - 95

EP - 99

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

Linear complexity of the Naor-Reingold pseudo-random function

Abstract

Access to Document

Other files and links

Fingerprint

Cite this