Non-linear Complexity of the Naor–Reingold Pseudo-random Function | Zendy

William D. Banks | Zendy; Frances Griffin | Zendy; Daniel Lieman | Zendy; Igor E. Shparlinski | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Non-linear Complexity of the Naor–Reingold Pseudo-random Function

Author(s) -

William D. Banks,

Frances Griffin,

Daniel Lieman,

Igor E. Shparlinski

Publication year - 2000

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-67380-6

DOI - 10.1007/10719994_5

Subject(s) - upper and lower bounds , function (biology) , computer science , computational complexity theory , exponential function , time complexity , algorithm , mathematics , discrete mathematics , combinatorics , mathematical analysis , evolutionary biology , biology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research