#### Filter Results:

#### Publication Year

2008

2010

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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 an oracle that gives only implicit information about p1. Namely, our oracle outputs a different N2 = p2q2 such that p1 and p2 share the t least significant bits.… (More)

We address the problem of polynomial time solving univari-ate modular equations with mutually co-prime moduli. For a given system of equations we determine up to which size the common roots can be calculated efficiently. We further determine the minimum number of equations which suffice for a recovery of all common roots. The result that we obtain is… (More)

- ‹
- 1
- ›