Cryptography Thinking about hosting a crypto related project at a private hackathon... |
Thinking about hosting a crypto related project at a private hackathon... Posted: 04 Jul 2018 06:00 PM PDT I am interested in having a booth at a hackathon where hackers try to create algorithms that factor integers in polynomial time. This will be for fun, as it's unlikely that we will solve the factoring problem. I'll mention:
Is this a good idea? This will be my first hackathon, so anything helps! Thanks in advance. [link] [comments] |
Is RSA or DH faster at the same security level? Posted: 04 Jul 2018 06:05 AM PDT I assume DH with a 1024 bit prime modulus is as strong as an RSA with a 2048 bit modulus that is the product of two 1024 bit long primes, because a 2^1024 space needs to be searched to solve the discrete logarithm problem in case of DH, meanwhile a 2^1024 space needs to be searched for the RSA modulus' factorisation - in case of brute force cracking. Thus taking the exponential modulus' cubic complexity into account and DH needing twice as many exponentiations with half the length modulus on one side, DH should be 4x faster. EDIT: according to resources that I shamefully didn't Google at first, Diffie-Hellmann is as strong as RSA if the its prime modulus is as long as RSA's prime product modulus. The new question is, why? Where do I go wrong in the above reasoning? [link] [comments] |
You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States |
No comments:
Post a Comment