scientific article; zbMATH DE number 1424198

MaRDI QIDQ4945398zbMATH OpenFDO

Authors Frances Griffin, Igor E. Shparlinski

Publication date 8 April 2002

zbMATH Keywords

pseudo-random functionsequence with exponentially large linear complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2048529
• On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.
• On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function
• On the linear complexity of the Naor-Reingold sequence

Cited in

(15)

• On the Naor-Reingold pseudo-random function from elliptic curves
• On the distribution of the Diffie-Hellman pairs
• On the linear complexity profile of some new explicit inversive pseudorandom numbers
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• 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 RSA pairs
• Linear complexity of the Naor-Reingold pseudo-random function
• On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
• On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function
• scientific article; zbMATH DE number 2048529 (Why is no real title available?)
• On the uniformity of distribution of the Naor-Reingold pseudo-random function
• On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.
• The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity
• On the period of the Naor-Reingold sequence

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 Q4945398)