Linear complexity of the Naor-Reingold pseudo-random function

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. 

• Type: Journal
• Year: 2000
• Where: IPL
• Authors: Igor Shparlinski
• Keywords: IPL 2000, Lower Bound, Non-linear Complexity, Pseudo-random