Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem

  • 197 Accesses

  • 18 Citations

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.

This is a preview of subscription content, log in to check access.

Author information

Correspondence to Rosario Gennaro.

Rights and permissions

Reprints 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

Download citation

  • Pseudorandomness
  • Discrete logarithm