Having perused the stackexchange, I discovered some comparable questions, however am having problem understanding easy methods to arrive on the answer to (n-1)*x=1 mod np, the place:
n: Finite group order of the Bitcoin secp256k1 curve
p: Prime order of the curve
and (n-1) shouldn’t be coprime to modulo np.
Having carried out the next step of np/2 and including .5 to consequence one, in order to attain:
Then subtracting the preliminary consequence with .5 to attain:
And following directions from solutions to associated posts, (n-1) is to be multiplicativeley inversed over mod F1 and F2. Nonetheless, neither F1 or F2 are coprime to (n-1). With the intention to overcome this, it’s defined that GCD and CRT are for use as a way to precisely calculate the modular inverse.
What steps are required and the way are the operations carried out to perform this?