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 bits of p1, we use

• Type: Conference
• Year: 2009
• Where: PKC
• Authors: Alexander May, Maike Ritzenhofen
• Keywords: Cryptography, PKC 2009, Time Factoring Rsa