Nonlinear complexity of the Naor-Reingold pseudo-random function

MOspace/Manakin Repository

Breadcrumbs Navigation

Nonlinear complexity of the Naor-Reingold pseudo-random function

Please use this identifier to cite or link to this item: http://hdl.handle.net/10355/10612

[+] show full item record


Title: Nonlinear complexity of the Naor-Reingold pseudo-random function
Author: Banks, William David, 1964-; Griffin, Frances; Lieman, Daniel, 1965-; Shparlinski, Igor E.
Keywords: linear polynomials
Date: 2000
Abstract: We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of the lower bound on the linear complexity of this function that has been obtained by F. Griffin and I. E. Shparlinski.
URI: http://hdl.handle.net/10355/10612

This item appears in the following Collection(s)

  • Mathematics publications (MU) [119]
    The items in this collection are the scholarly output of the faculty, staff, and students of the Department of Mathematics.

[+] show full item record