✦ LIBER ✦

On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves

✍ Scribed by Igor E. Shparlinski; Joseph H. Silverman

Book ID: 110298672
Publisher: Springer
Year: 2001
Tongue: English
Weight: 94 KB
Volume: 24
Category: Article
ISSN: 0925-1022
DOI: 10.1023/a:1011223204345

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Naor–Reingold Pseudo-Random Funct

On the Naor–Reingold Pseudo-Random Function from Elliptic Curves

✍ Igor E. Shparlinski 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 62 KB

On the Uniformity of Distribution of the

On the Uniformity of Distribution of the Naor–Reingold Pseudo-Random Function

✍ Igor E. Shparlinski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 292 KB

We show that the new pseudo-random number function, introduced recently by M. Naor and O. Reingold, possesses one more attractive and useful property. Namely, it is proved that for almost all values of parameters it produces a uniformly distributed sequence. The proof is based on some recent bounds

On the linear complexity of the Naor–Rei

On the linear complexity of the Naor–Reingold sequence

✍ Domingo Gómez; Jaime Gutierrez; Álvar Ibeas 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 120 KB

On the μ-invariant of p-adic L-functions

On the μ-invariant of p-adic L-functions attached to elliptic curves with complex multiplication

✍ Leila Schneps 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 699 KB