If the bit size is 128 bits, I know that BSGS is not possible due to memory issues.
I know that the complexity of Pollard-rho for 128 bits is 2^64.
and I know that it is not possible to do 2 ^ 64 operations on a typical computer.
Is there any other way? do solve 128bit ECDLP when ord(G)=prime number