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.
Cite
CITATION STYLE
APA
Banks, W. D., Griffin, F., Lieman, D., & Shparlinski, I. E. (2000). Non-linear complexity of the naor-reingold pseudo-random function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1787, pp. 53–59). Springer Verlag. https://doi.org/10.1007/10719994_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free