Using Python. Determine for (p,g) the smallest positive power of g, mod p, that gives 1. Where p is 133860127459963, and g is 120810127469971 for a Diffie Hellman key exhange. This power is always a divisor of p-1, so start the search there.

Use the Hellman-Pohlig-Silver algorithm to attempt to find for each key exchange, for each share the discrete logarithm of the share relative to g and p.

Share 1= 73143945397032

Share 2=963503900647