You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi, I am reading your article : Hacking private keys from unsafe primes using the Pohlig-Hellman discrete logarithm. I found that the final solution for 6^a = 2 % p does not seem to use the small subgroup. Just like 100000008359680 = 2^8 5 11^2 13 19 31 37 43 53. Instead, solve the DLP problem directly in the large group p = 100000008359681. I am confused about this, please help me understand, thanks
The text was updated successfully, but these errors were encountered:
Thank you for your quickly reply. I have a few other questions I want to ask.
I'm trying to implement a small subgroup attack, and I've been stuck in this for a few days. So, can you tell me how to implement a small subgroup attack with the small group defined by small prime factor?
Hi, I am reading your article : Hacking private keys from unsafe primes using the Pohlig-Hellman discrete logarithm. I found that the final solution for
6^a = 2 % p
does not seem to use the small subgroup. Just like100000008359680 = 2^8 5 11^2 13 19 31 37 43 53
. Instead, solve the DLP problem directly in the large group p = 100000008359681. I am confused about this, please help me understand, thanksThe text was updated successfully, but these errors were encountered: