MathDB2 problems
- 0 votes0 replies1 view
Hardness of cube-root finding modulo RSA moduli without factoring equivalence
Cube-root hardness conjecture. Finding roots for this family is conjectured to be hard, and is conjectured not to be as hard as integer factorization.
- 0 votes0 replies0 views
Hardness of finding roots of generic polynomials modulo RSA moduli
Root-finding hardness conjecture. The majority of such polynomials are conjectured to have hard root-finding problems, with hardness not based on integer factorization.