Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

GI
2007
Springer

favoriteEmaildiscussreport

93views Theoretical Computer Science» more GI 2007»

On Factoring Arbitrary Integers with Known Bits

14 years 5 months ago

On Factoring Arbitrary Integers with Known Bits

Download eprint.iacr.org

: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. Our goal is to ﬁnd the full factorization of N in polynomial time with a minimal number of calls to the oracle. We present a rigorous algorithm that efﬁciently factors N given (1 − 1 r Hr) log N bits, where Hr denotes the rth harmonic number.

Mathias Herrmann, Alexander May

Real-time Traffic

Composite Integer | GI 2007 | Oracle Access | Prime Factors | Theoretical Computer Science |

claim paper

Related Content

» Factorization of SquareFree Integers with High Bits Known

» Solving Linear Equations Modulo Divisors On Factoring Given Any Bits

» Simultaneous Hardcore Bits and Cryptography against Memory Attacks

» FactorizationBased FailStop Signatures Revisited

» Finding Small Roots of Bivariate Integer Polynomial Equations A Direct Approach

» Numerical linear algebra in the streaming model

» Computation of Highly Regular Nearby Points

» Local Topological Toughness and Local Factors

» Hardware Factorization Based on Elliptic Curve Method

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	GI
Authors	Mathias Herrmann, Alexander May

Comments (0)