I am looking at an answer to a previous question and I would like more detail about how the answer was arrived at but I am not allowed to comment as I am a new user with low points.
I am therefore asking a new question based on an answer to a previous question. An answer was given but the details were not shown as to how the answer was derived. I have looked on line at methods of manipulating linear equations but they only show basic examples.
Could someone please show me step by step how the answer was arrived at.
This was the previous question. Is it possible to decrypt an ECDSA private key if the same nonce is used across different private keys?
In the answer there is a linear system of 4 equations in field Zp with 4 unknowns k1, k2, x1, x2. The other variables s, r and h are known.
What are the steps to get from:
s1k1 - r1x1 = h1 (mod p)
s2k1 - r1x2 = h2 (mod p)
s3k2 - r2x1 = h3 (mod p)
s4k2 - r2x2 = h4 (mod p)
(in the equations above h is congruent)
X1 = (h1r2s2s3 - h2r2s1s3 -h3r1s1s4 + h4r1s1s3)/ r1r2(s1s4 - s2s3)
where operations including division are in the multiplicative group Z∗p.