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.

  • $\begingroup$ Do you know about the extended Euclidean algorithm? $\endgroup$ – Tob Ernack Jul 11 '17 at 20:15
  • $\begingroup$ Did you try with python? $\endgroup$ – N74 Jul 11 '17 at 20:17
  • $\begingroup$ The calculator GP/PARI can do it very easily. Example Mod(110528812453801822904317758417383912041757712635384174764936784734826169201757, 123897535483928329103220953959296061402998883592235403522219614888467048714837)^(-1). $\endgroup$ – Jeppe Stig Nielsen Jul 11 '17 at 20:22
  • $\begingroup$ I know about the Euclidean algorithm but using it with 256 bits numbers is really hard to do it without a calculator. $\endgroup$ – niko Jul 12 '17 at 8:41
  • $\begingroup$ Do you have any recommendation for a python script N74? $\endgroup$ – niko Jul 12 '17 at 8:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.