Hi, I’ve been working on several prototypes of Diffie-Hellman variants for a while now. I have come across a construction that can withstand DLP attacks. However, since I am unable to resolve the secret private key or the shared secret derived with other methods, I thought I would see how others judge the harshness of this group-based math problem. There is documentation and Python code examples on Github, if anyone wants to try it out. I appreciate all the time spent in this effort. Thanks! [https://github.com/pvial00/FetuPKD](https://github.com/pvial00/FetuPKD)
Cryptoplatforming.com is a news websites which gets news around the globe on investing in Crypto. Our news has no backgroundcheck.