Jump to content
Tuts 4 You

[KeygenMe] KeygenMe


Nooby
Go to solution Solved by xSRTsect,

Recommended Posts

Actually I'v re-read the Miller's Theory, and in deed not only this exploit is very antique it is also the basis of the most primality tests. I wasn't aware of this at all.


 


User: Tuts4You


Req: A799CB8D37C11F8052AA59674A0E89957205F69BE447F887306A02934F4863652C418D6B268070B4B95C500B89FD89D13612D0A9961E0FA39CD033A094F015B5E0FB48BFA37D25834496AD4D68E4FA097D0454303545C89CCBD9898D96021CA8480F06414D8BD28A194C5786EA167BACBD19E259E803EBBB6C74D7367E4615873FD8CA2654055E564DFA145C1A62FAC9DE5D156709F6B6067B014C9DF4D7C7A32E7012B84859AF9A3232EF531904045F272ABBE063D75336B516226049BEAD28


 


Act: your key is: 1e10de218320d31489c3b293ea4837dd90c0b12ae27c341fcd4a41f364b03892cd6048496a8161012c356a9a22f56d74e8fd7a64f59ebe01fbeba3371d1fed8a


 


I also need to reprogram my rng attack, (this one is taking about 5 minutes do generate a key)


kg.zip

  • Like 1
Link to comment
Share on other sites

Great work. Looking forward to your optimized RNG attack. Step 1 is inspired by DSA-1571-1 which lead to a major reissue of certificates across the Internet. Now you've learned some notable properties of RSA, I'm glad that my KeygenMe served its purpose.


Link to comment
Share on other sites

Solution accepted. One slight improvement to make it O(1): multiply all primes from the table, calculate gcd(primes, N) to find out witch. :)

Link to comment
Share on other sites

@MistHill

Off topic: I'll factor that 512bit modulus, so you don't need to patch it. :)

Hmily told me you've succeeded almost within one week!?

 

Essentially what I had, but now it is trully O(2^16) via a table.

Excellent work!

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...