Login / Signup
On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves.
Igor E. Shparlinski
Joseph H. Silverman
Published in:
Des. Codes Cryptogr. (2001)
Keyphrases
</>
linear complexity
pseudorandom
elliptic curve
uniformly distributed
random numbers
power analysis
data streams
similarity search
random number
scalar multiplication