Is there an algorithm that can solve a non-linear congruence in modular arithmetic? I read that such a problem is classified as NP-complete.
In my specific case the congruence is of the form:
x^3 + ax + b congruent to 0 (mod 2^64)
where a and b are known constants and I need to solve it for x.
Look at Hensel's lemma.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With