Chai Wah Wu
Linear Algebra and Its Applications
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.
Chai Wah Wu
Linear Algebra and Its Applications
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.