I'm trying to resolve a discrete logarithm equation:
$$y = g^x \bmod p$$
Every parameter is a 512-bit number. I know the values for $g$, $y$ and $p$ and I need to find the $x$ value. Finally, I know that $g$ is a primitive root of $p$.
I tried to look at some related topics about the discrete logarithm, but I can't figure out how to implement an effective algorithm to solve this problem.
Here you can find the value for each parameter: http://pastebin.com/JKvedKNd
I have started to look at how some algorithm works, but I would like to know depending on these value parameters which could be the more efficient.
It is 80 bits from the actual record I think: https://en.wikipedia.org/wiki/Discrete_logarithm_records. So there is something I am missing due to my lack of skills in the mathematics area.