Approximate Integer Common Divisors
- 1.5k Downloads
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us to consider the question of “fully” approximate common divisors, i.e. where both integers are only known by approximations. We explain the lattice techniques in both the partial and general cases. As an application of the partial approximate common divisor algorithm we show that a cryptosystem proposed by Okamoto actually leaks the private information directly from the public information in polynomial time. In contrast to the partial setting, our technique with respect to the general setting can only be considered heuristic, since we encounter the same “proof of algebraic independence” problem as a subset of the above authors have in previous papers. This problem is generally considered a (hard) problem in lattice theory, since in our case, as in previous cases, the method still works extremely reliably in practice; indeed no counter examples have been obtained. The results in both the partial and general settings are far stronger than might be supposed from a continued-fraction standpoint (the way in which the problems were attacked in the past), and the determinant calculations admit a reasonably neat analysis.
KeywordsGreatest common divisor approximations Coppersmith’s method continued fractions lattice attacks
Unable to display preview. Download preview PDF.
- 1.D. Coppersmith. Finding a small root of a bivariate integer equation Proc. of Eurocrypt’96 Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, 1996Google Scholar
- 4.D. Boneh, G. Durfee and Y. Frankel. An attack on RSA given a small fraction of the private key bits. In proceedings AsiaCrypt’98, Lecture Notes in Computer Science, Vol. 1514, Springer-Verlag, pp. 25–34, 1998.Google Scholar
- 5.D. Boneh, G. Durfee and N. Howgrave-Graham Factoring N = p r q for large r. In Proceedings Crypto’ 99, Lecture Notes in Computer Science, Vol. 1666, Springer-Verlag, pp. 326–337, 1999.Google Scholar
- 6.G.H. Hardy and E.M. Wright. An introduction to the theory of numbers, 5’th edition. Oxford University press, 1979.Google Scholar
- 7.N.A. Howgrave-Graham. Computational mathematics inspired by RSA. Ph.D. Thesis, Bath University, 1999.Google Scholar
- 13.V. Shoup. NTL: A Library for doing Number Theory (version 4.2) http://www.shoup.net
- 14.B. Vallée, M. Girault and P. Toffin. Proceedings of Eurocrypt’ 88 LNCS vol. 330, pp. 281–291, 1988.Google Scholar