47 search results - page 10 / 10 » The 1.5D sieve algorithm |
FCCM
2005
IEEE
13 years 10 months ago
2005
IEEE
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
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 ...