An Improved Pseudo-random Generator Based on Discrete Log

@inproceedings{Gennaro2000AnIP,
  title={An Improved Pseudo-random Generator Based on Discrete Log},
  author={Rosario Gennaro},
  booktitle={CRYPTO},
  year={2000}
}
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pseudo-random bit generator. This new generator outputs n− c− 1 bits per exponentiation with a c-bit exponent. Using typical parameters, n = 1024 and c = 160, this yields roughly 860 pseudo-random bits per small exponentiations. Using an implementation with quite small precomputation tables, this yields a rate of more… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
34 Citations
18 References
Similar Papers

Citations

Publications citing this paper.

56 Citations

0510'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…