Don Coppersmith
Journal of Cryptology
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
Don Coppersmith
Journal of Cryptology
Don Coppersmith
Journal of Complexity
Elliot N. Linzer, Ephraim Feig
IEEE TSP
Don Coppersmith, Baruch Schieber
FOCS 1992