I have seen your posts on Bitcointalk forum and saw your repository on Github. I have been trying to reduce a bitcoin public key by doing scalar multiplication and searching the found keys in 32 bit range. So far I had no luck. On your Github page you have mentioned Cado-nfs in order to solve the discrete log problem. Could you please explain what do you mean by using Cado-nfs software for this method? In my knowledge one can find discrete log in DSA-RSA encryption methods however finding elliptic curve discrete log is close to impossible. If you could give your knowledge about this topic I would be much appreciated.
Hello,
I have seen your posts on Bitcointalk forum and saw your repository on Github. I have been trying to reduce a bitcoin public key by doing scalar multiplication and searching the found keys in 32 bit range. So far I had no luck. On your Github page you have mentioned Cado-nfs in order to solve the discrete log problem. Could you please explain what do you mean by using Cado-nfs software for this method? In my knowledge one can find discrete log in DSA-RSA encryption methods however finding elliptic curve discrete log is close to impossible. If you could give your knowledge about this topic I would be much appreciated.
Regards, Raccoon