Ephraim Feig, Elliot Linzer
IEEE TSP
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
Ephraim Feig, Elliot Linzer
IEEE TSP
Zeev Barzilai, Don Coppersmith, et al.
IEEE TC
Don Coppersmith
Cryptologia
Inder Gopal, Don Coppersmith, et al.
IEEE Transactions on Communications