Set generator $g \equiv 5 \pmod p$ where $p=647$ and $p$ is prime.
With the same $g$, $p$ and secret signing key $x$, Alice sends two messages, $428$ and $129$, with signatures $(433, 239)$ and $(433, 100)$ respectively. She uses the same ephemeral key twice.
The question says without using a discrete logarithm algorithm, determine both her secret signing key $x$ and her ephemeral key $k$.
Could anybody help me in what direction I need to go to solve this? I'm not sure what to do without the use of discrete logs.