Abstract
Under the assumption that solving the discrete logarithm problem modulo an n-bit safe prime p is hard even when the exponent is a small c-bit number, we construct a new pseudo-random bit generator. This new generator outputs n – c – 1 bits per exponentiation with a c-bit exponent and is among the fastest generators based on hard number-theoretic problems.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gennaro, R. An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem. J Cryptology 18, 91–110 (2005). https://doi.org/10.1007/s00145-004-0215-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-004-0215-y