A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Synthesizers and their application to the parallel construction of pseudo-random functions
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
On the uniformity of distribution of the RSA pairs
Mathematics of Computation
On the distribution of the power generation
Mathematics of Computation
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
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the Uniformity of Distribution of the Naor-Reingold Pseudo-Random Function
Finite Fields and Their Applications
On the complexity of the discrete logarithm and Diffie-Hellman problems
Journal of Complexity - Special issue on coding and cryptography
| Hi-index | 0.00 |
Let F"p be a prime field of p elements and let g be an element of F"p of multiplicative order t modulo p. We show that for any @e0 and t=p^1^/^3^+^@e the distribution of the Diffie-Hellman pairs (x, g^x) is close to uniform in the Cartesian product Z"txF"p, where x runs through*the residue ring Z modulo (that is, as in the classical Diffie-Hellman scheme); *The all -sums =+...+, 1@?