On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves
Designs, Codes and Cryptography
Designs, Codes and Cryptography
Designs, Codes and Cryptography
Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves
Information Security and Cryptology
Construction of pseudo-random binary sequences from elliptic curves by using discrete logarithm
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Remarks on Pseudorandom Binary Sequences Over Elliptic Curves
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
| Hi-index | 0.00 |
Random numbers are useful in many applications such as Monte Carlo simulation, randomized algorithms, games, and password generation. It is important to be able to prove facts about pseudo-random number generators, both about the distribution and the predictability of the pseudo-random numbers. I discuss a pseudo-random number generator based on elliptic curves taken over finite fields. This class of generators can produce provably good pseudo-number generators. Also, I prove that the analog of a faster pseudo-random number generator embedded in an elliptic curve fails to produce good pseudo-random numbers.