How is there not a way to solve discrete logarithms on prime fields? Yes, if you look at it using real numbers, the inverse is not a function because it has multiple outputs. However, if you just look at it using integers, a function could in theory exist because prime fields (assuming generated using a primitive root), have a unique output to each input meaning it's bijective. There has to be some general function or operation that exists to inverse the operation. How has nobody found it yet?