Sciweavers

IPL
2000
98views more  IPL 2000»
14 years 8 days ago
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 t...
Igor Shparlinski