Maybe I know too little information about it. I think I have some idea now, not sure if I am correct about it. By subtracting known 130 public key to lower bits to find the lower bits private key, once gotten that private key you do an inverse of lower bit private key back to 130 bits. Am I right?
Yes that is correct if you have some case like this:
P130 - PA = X
P130 - PB = Y
P130 - PC = Z
...
P130 - PM = N
if you found the privatekey of any X, Y, Z or N you only need to apply the inverse process to get the Private key of P130, you only need to be aware of what are the values of PA,PB PC and PM
the same appy for other operations like addition, multiplication and division
Regards!
Thanks. Maybe will try it later. More focusing on 66 now. If my idea and approach works and able to solve 66, then 67 and 68 should be also solvable in short period of time.