Nonlinear complexity of the Naor-Reingold pseudo-random function
Banks, William David, 1964-
Lieman, Daniel, 1965-
Shparlinski, Igor E.
Metadata[+] Show full item record
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.
Mathematics publications (MU)