On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.

DOI10.1023/A:1011223204345zbMath1077.11504OpenAlexW1512848798MaRDI QIDQ5960283

Igor E. Shparlinski, Joseph H. Silverman

Publication date: 15 April 2002

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011223204345

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Exponential sums (11T23) Finite ground fields in algebraic geometry (14G15) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (14)

Polynomial interpolation of the Naor-Reingold pseudo-random function ⋮ Binary sequences from a pair of elliptic curves ⋮ On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function ⋮ Attacking the linear congruential generator on elliptic curves via lattice techniques ⋮ On the linear complexity of the Naor-Reingold sequence ⋮ Elliptic curve analogue of Legendre sequences ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ On the period of the Naor-Reingold sequence ⋮ On the uniformity of distribution of the Naor-Reingold pseudo-random function ⋮ On the linear complexity of the Naor-Reingold sequence with elliptic curves ⋮ Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves ⋮ Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits ⋮ On the linear complexity and multidimensional distribution of congruential generators over elliptic curves ⋮ On the distribution of the Diffie-Hellman pairs

This page was built for publication: On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.