Discrete Logarithm (512 bits numbers) - Find exponent parameter 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.
You're right in that there's little chance you can break the logarithm in a well-chosen 512 bit group (using a home computer, in reasonable time — as pointed out by SEJPM, it is possible investing some time and a good amount of money). However, in your case, the parameters are bad: The order of $(\mathbb Z/p\mathbb Z)^\ast$, that is $p-1$, is a smooth number:


  $ factor 7863166752583943287208453249445887802885958578827520225154826621191353388988908983484279021978114049838254701703424499688950361788140197906625796305008451718
  7863166752583943287208453249445887802885958578827520225154826621191353388988908983484279021978114049838254701703424499688950361788140197906625796305008451718: 2 131 131 131 131 131 173 181 181 181 181 181 347 347 347 347 347 353 353 353 353 353 379 379 379 379 379 461 461 487 487 491 491 547 547 547 547 547 727 727 751 751 751 769 769 769 887 887 887 887 887 907 907 907 907 907 911 911 911 911


Hence, you can apply the algorithm of Pohlig and Hellman to efficiently find logarithms modulo $p$.