Linear complexity of the Naor-Reingold pseudo-random function

DOI10.1016/S0020-0190(00)00133-2zbMath1339.94065MaRDI QIDQ294859

Igor E. Shparlinski

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001332?np=y

zbMATH Keywords

cryptographylinear complexityNaor-Reingold pseudo-random function

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function ⋮ On the linear complexity of the Naor-Reingold sequence ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ On the uniformity of distribution of the Naor-Reingold pseudo-random function ⋮ On the linear complexity of the Naor-Reingold sequence with elliptic curves

Cites Work

• Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles
• On the Naor-Reingold pseudo-random function from elliptic curves
• On the uniformity of distribution of the Naor-Reingold pseudo-random function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear complexity of the Naor-Reingold pseudo-random function