N. Howgrave-graham, Approximate Integer Common Divisors, Cryptography and Lattices, pp.51-66, 2001.
DOI : 10.1007/3-540-44670-2_6

H. Cohn and N. Heninger, Approximate common divisors via lattices, The Open Book Series, vol.1, issue.1
DOI : 10.2140/obs.2013.1.271

M. Van-dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, Fully Homomorphic Encryption over the Integers
DOI : 10.1007/978-3-642-13190-5_2

I. Z. Emiris, A. Galligo, and H. Lombardi, Certifed approximate univariate GCDs, J.Pure Appl. Algebra, vol.117118, pp.229-251, 1997.

V. Y. Pan, Numerical computation of a polynomial GCD and extensions, pp.71-85, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00073729

A. Schäonhage and Q. Computations, Quasi-GCD computations, Journal of Complexity, vol.1, issue.1, pp.118-137, 1985.
DOI : 10.1016/0885-064X(85)90024-X