Modular Cubic Formula

750 Views Asked by At

What would be the process of solving a modular cubic equation? Eg. $$ax^3+bx^2+cx+d=0\pmod n$$ In the case that I was given, $d$ is a (very) large number, so rational root theorem isn't a viable option. I have two of these cubic equations and I have to find an $x$ value that satisfies both of them, so is there any method to solving this problem? If it means anything, the cubic I'm dealing with is factorable to a form of $(ax+b)^3$

1

There are 1 best solutions below

8
On

If you can factor the cubic into the form you give (I assume the $a$ and $b$ in the factored form are different from the $a$ and $b$ in the non-factored form), then you are just trying to find $x$ so that $(ax+b)^3\equiv 0\mod n$. Trying to solve $y^3\equiv 0\mod n$ first might help then.

If $d$ is very large compared to $n$, you might also want to try reducing $d$ modulo $n$ to a number $d'$ between $0$ and $n-1$, inclusive, before you do anything else.