Don Coppersmith
Proceedings of the American Mathematical Society
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.
Don Coppersmith
Proceedings of the American Mathematical Society
Don Coppersmith
Journal of Cryptology
Don Coppersmith, Michel Petitjean
Comptes Rendus Mathematique
Nikhil Bansal, Danny Z. Chen, et al.
Algorithmica (New York)