Y.Y. Li, K.S. Leung, et al.
J Combin Optim
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.
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Minghong Fang, Zifan Zhang, et al.
CCS 2024
D.S. Turaga, K. Ratakonda, et al.
SCC 2006
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997