Download When e-th Roots Become Easier Than Factoring

Queue processing for download document We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the form x i  + c.