Elliot Linzer, Ephraim Feig
Mathematics of Computation
A new algorithm for computing Hadamard transforms is presented. If n is a power of four, then the new algorithm uses ⅞ n logn multiply/adds to compute a Hadamard transform of length n. © 1994 IEEE
Elliot Linzer, Ephraim Feig
Mathematics of Computation
Phillip Rogaway, Don Coppersmith
Journal of Cryptology
C.K. Wong, Don Coppersmith
Journal of the ACM
Don Coppersmith, David Gamarnik, et al.
Random Structures and Algorithms