Linear complexity of the Naor-Reingold pseudo-random function
Information Processing Letters
On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves
Designs, Codes and 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
On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves
Designs, Codes and Cryptography
On the Distribution of the Diffie-Hellman Pairs
Finite Fields and Their Applications
| Hi-index | 0.00 |
We show that the new pseudo-random number function, introduced recently by M. Naor and O. Reingold, possesses one more attractive and useful property. Namely, it is proved that for almost all values of parameters it produces a uniformly distributed sequence. The proof is based on some recent bounds of character sums with exponential functions.