scientific article; zbMATH DE number 2048529

MaRDI QIDQ4452561zbMATH OpenFDO

Authors William D. Banks, Frances Griffin, Daniel Lieman, Igor E. Shparlinski

Publication date 1 March 2004

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Linear complexity of the Naor-Reingold pseudo-random function
• scientific article; zbMATH DE number 1424198
• Polynomial interpolation of the Naor-Reingold pseudo-random function
• On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.
• On the linear complexity of the Naor-Reingold sequence

Cited in

(10)

• Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions
• Linear complexity of the Naor-Reingold pseudo-random function
• On the distribution of the Diffie-Hellman pairs
• On the uniformity of distribution of the RSA pairs
• On the linear complexity of the Naor-Reingold sequence
• Polynomial interpolation of the Naor-Reingold pseudo-random function
• On the uniformity of distribution of the Naor-Reingold pseudo-random function
• On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function
• The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity
• Distribution and polynomial interpolation of the Dodis-Yampolskiy pseudo-random function

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452561)