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

Under the assumption that solving the discrete logarithm problem modulo ann-bit safe prime p is hardeven 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 ac-bit exponent and is among the fastest generators based on hard number-theoretic problems.