Timeline for What is the step-by-step algorithmic process to find the modular multiplicative inverse of (n-1) mod np, where (n-1) and np are not coprime?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2023 at 19:36 | comment | added | Alfhilðr ínn Seiðkona | Yes, I believe that is what I am looking for, as I was not understanding the problem itself. The entirety of the equation I am trying to solve is: (n-1)*x=G.x mod np. | |
| Mar 3, 2023 at 14:33 | comment | added | Murch♦ | So, are you looking for a modular division instead of an inverse? | |
| Mar 2, 2023 at 21:00 | answer | added | Pieter Wuille | timeline score: 1 | |
| Mar 2, 2023 at 19:03 | comment | added | Alfhilðr ínn Seiðkona | There is a way to achieve the multiplicative inverse as I have seen it done, the professor who achieved it is assisting me, but he is forcing me to figure out the method (it is unpublished, obviously). Also, I did see a Stackexchange answer explaining the method, as well. I have the Python coding for it, but I am trying to reverse engineer it manually. | |
| Mar 2, 2023 at 14:02 | comment | added | Pieter Wuille | If two numbers a and m are not coprime, no multiplicative inverse of a modulo m exists. | |
| Mar 2, 2023 at 0:31 | history | asked | Alfhilðr ínn Seiðkona | CC BY-SA 4.0 |