3 problems

Continued-fraction hyperbola attack conjecture. For all $i\in\{1,2,3,4\}$, the associated coefficients satisfy

Let $n=pq$ be an RSA modulus, and write $\mathbf{RSA}(n)$ for the problem of breaking RSA and $\mathbf{Fact}(n)$ for the problem of factoring $n$. Write $\mathbf{Rabin}(n)$ for the…

Paillier–Villar's non-malleability conjecture. Most instance generators are non-malleable.