All Questions

We got argument and strong experimental support that integers of the form $n=p q^2$ can be factored using elliptic curves easier than general integers Q1 Is this known? Added This is known since at ...

Sieve techniques apply to integer factoring and discrete logarithm to provide $2^{O(((\log n)(\log\log n)^2)^{1/3})}$ complexity for $n$ bit factoring and $n$ bit prime discrete logarithm. The state ...

Is it any easy to factor $p-1$ when $p$ is a prime compared to general factorization problem? What about when $2p+1$ is also a prime?