On the linear complexity of the Naor-Reingold sequence

DOI10.1016/j.ipl.2011.05.017zbMath1260.94040OpenAlexW1966808162MaRDI QIDQ1944149

Álvar Ibeas, Jaime Gutierrez, Domingo Gomez

Publication date: 4 April 2013

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.017

zbMATH Keywords

cryptographypseudorandom numberslinear complexity

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function

Cites Work

• Unnamed Item
• Linear complexity of the Naor-Reingold pseudo-random function
• On the linear complexity of the Naor-Reingold sequence with elliptic curves
• On the period of the Naor-Reingold sequence
• Number-theoretic constructions of efficient pseudo-random functions
• Character sums with exponential functions
• 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.

This page was built for publication: On the linear complexity of the Naor-Reingold sequence