Paper 2009/626
Approximate Integer Common Divisor Problem relates to Implicit Factorization
Santanu Sarkar and Subhamoy Maitra
Abstract
In this paper, we analyse how to calculate the GCD of
Note: New results and detailed comparisons with existing works added.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Greatest Common DivisorFactorizationInteger ApproximationsImplicit FactorizationLatticeLLL
- Contact author(s)
- subho @ isical ac in
- History
- 2010-05-11: last of 2 revisions
- 2009-12-26: received
- See all versions
- Short URL
- https://ia.cr/2009/626
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/626, author = {Santanu Sarkar and Subhamoy Maitra}, title = {Approximate Integer Common Divisor Problem relates to Implicit Factorization}, howpublished = {Cryptology {ePrint} Archive, Paper 2009/626}, year = {2009}, url = {https://eprint.iacr.org/2009/626} }