Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
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. © 2004 International Association for Cryptologic Research.
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
Charles Micchelli
Journal of Approximation Theory
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011