Sciweavers

PKC
2009
Springer
175views Cryptology» more  PKC 2009»
15 years 2 days ago
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
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 b...
Alexander May, Maike Ritzenhofen