Robert Cimikowski, Don Coppersmith
Discrete Mathematics
Given two k element subsets S, T ⊆ Zn, we give a quasi-linear algorithm to either find λ ∈ Zn* such that S = λ T or prove that no such λ exists. This question is closely related to isomorphism testing of circulant graphs and has recently been studied in the literature. © 2005 Elsevier B.V. All rights reserved.
Robert Cimikowski, Don Coppersmith
Discrete Mathematics
Phillip Rogaway, Don Coppersmith
Journal of Cryptology
Don Coppersmith, Shmuel Winograd
Journal of Symbolic Computation
Zeev Barzilai, Don Coppersmith, et al.
IEEE TC