Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint

14 years 5 months ago

Download www.cits.rub.de

We address the problem of polynomial time factoring RSA moduli N1 = p1q1 with the help of an oracle. As opposed to other approaches that require an oracle that explicitly outputs bits of p1, we use

Alexander May, Maike Ritzenhofen

Real-time Traffic

Cryptography | PKC 2009 | Time Factoring Rsa |

claim paper

» Solving Linear Equations Modulo Divisors On Factoring Given Any Bits

» Approximate implicitization of planar curves by piecewise rational approximation of the di...

» On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors

» Selfassessment of Motivation Explicit and Implicit Indicators in L2 Vocabulary Learning

» Truthful mechanisms with implicit payment computation

» OneClass Matrix Completion with LowDensity Factorizations

» CostOptimal Factored Planning Promises and Pitfalls

» Fast contextaware recommendations with factorization machines

Post Info
More Details (n/a)

Added	25 Nov 2009
Updated	25 Nov 2009
Type	Conference
Year	2009
Where	PKC
Authors	Alexander May, Maike Ritzenhofen

Comments (0)

Sciweavers

Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint

Cryptography | PKC 2009 | Time Factoring Rsa |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers