Modular multiplicative inverse problem.

Asked Jul 11 '17 at 20:12

Active Jan 02 '18 at 19:50

Viewed 141 times

I am trying to calculate the multiplicative inverse of big integers of 256 bits and I am not able to find a good calculator to resolve it.

I have found some online calculators but the result is not correct.

Can someone please help? thanks.

asked Jul 11 '17 at 20:12

niko

Do you know about the extended Euclidean algorithm? – Tob Ernack Jul 11 '17 at 20:15
Did you try with python? – N74 Jul 11 '17 at 20:17
The calculator GP/PARI can do it very easily. Example Mod(110528812453801822904317758417383912041757712635384174764936784734826169201757, 123897535483928329103220953959296061402998883592235403522219614888467048714837)^(-1). – Jeppe Stig Nielsen Jul 11 '17 at 20:22
I know about the Euclidean algorithm but using it with 256 bits numbers is really hard to do it without a calculator. – niko Jul 12 '17 at 08:41
Do you have any recommendation for a python script N74? – niko Jul 12 '17 at 08:41
Can you please share the link for the GP/PARI calculator Nielsen? thanks – niko Jul 12 '17 at 08:42
In python just use pow(v, N-2, N) for prime $N$ – N74 Jul 15 '17 at 12:24

0 Answers0