On the Naor-Reingold pseudo-random function from elliptic curves
From MaRDI portal
Publication:1583882
DOI10.1007/s002000000023zbMath1011.11055OpenAlexW2087244305MaRDI QIDQ1583882
Publication date: 4 June 2003
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002000000023
discrepancyuniformly distributed sequencepseudo-random functionbounds of character sumselliptic curve analogue
Random number generation in numerical analysis (65C10) Estimates on character sums (11L40) General theory of distribution modulo (1) (11K06) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items
Polynomial interpolation of the Naor-Reingold pseudo-random function, Binary sequences from a pair of elliptic curves, Linear complexity of the Naor-Reingold pseudo-random function, On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function, Pseudorandom bit sequence generator for stream cipher based on elliptic curves, Attacking the linear congruential generator on elliptic curves via lattice techniques, Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves, On the uniformity of distribution of the RSA pairs, Elliptic curve analogue of Legendre sequences, On lattice profile of the elliptic curve linear congruential generators, 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, Extractors for binary 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
