Finite fields
Handbook of Applied Cryptography
Handbook of Applied Cryptography
On the Linear Complexity of the Naor-Reingold Pseudo-Random Function
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
Non-linear Complexity of the Naor-Reingold Pseudo-random Function
ICISC '99 Proceedings of the Second International Conference on Information Security and Cryptology
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Linear Congruential Generators Over Elliptic Curves
Linear Congruential Generators Over Elliptic Curves
On the Uniformity of Distribution of the Naor-Reingold Pseudo-Random Function
Finite Fields and Their Applications
Designs, Codes and Cryptography
Designs, Codes and Cryptography
On the period of the Naor--Reingold sequence
Information Processing Letters
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
On the linear complexity of the Naor-Reingold sequence with elliptic curves
Finite Fields and Their Applications
On the Uniformity of Distribution of the Naor-Reingold Pseudo-Random Function
Finite Fields and Their Applications
On the Distribution of the Diffie-Hellman Pairs
Finite Fields and Their Applications
| Hi-index | 0.00 |
We show that the elliptic curve analogue of the pseudo-random number function, introduced recently by M. Naor and O. Reingold, produces a sequence with large linear complexity. This result generalizes a similar result of F. Griffin and I. E. Shparlinski for the linear complexity of the original function of M. Naor and O. Reingold. The proof is based on some results about the distribution of subset-products in finite fields and some properties of division polynomials of elliptic curves.