Cryptography Fermat's factorization method for faulty RSA keys |
- Fermat's factorization method for faulty RSA keys
- What is a better way to to prevent replay attack & 4096 Deffie Hellman?
- QRNG
- How can a public key fingerprint be generated in PyNaCl?
- Link hashed encrypted data with its hashed key ?
- What to learn after RSA?
| Fermat's factorization method for faulty RSA keys Posted: 15 Apr 2019 07:44 PM PDT Hey, I'm doing a crpyto CTF where I have an RSA public key and a cipher message encrypted with it, and the primes for the RSA key have been generated such that they're very close to each other (max 10 numbers apart), so this should mean that I can use Fermat's factorization method to quickly factor the modulus number in the public key, right? Reading wikipedia, there seem to be two major improvements the speed of the algorithm, and I'm assuming they're important as a Python implementation left for an hour didn't yield anything. Of the two of these one is called the 'Multiplayer improvement', which states that if the rough ratio of p/q is known, a rational number u/v can be chosen close to that value, and running the factorization method on the number Nuv returns other numbers which can be used to quickly find the actual p and q values. I'm somewhat confused on this though - if p and q are close, then p/q ~= 1, which means u=v and any u can be chosen. Could I literally throw 9 or 2 or whatever into this algorithm, and have it work to obtain the original numbers? I just want to make sure I'm understanding this properly. Thanks. [link] [comments]  |
| What is a better way to to prevent replay attack & 4096 Deffie Hellman? Posted: 15 Apr 2019 10:54 PM PDT I want to carry out communication between two python threads running on a network. I am using Deffie-Hellman key exchange 4096 bit group from RFC 3526. I want to prevent the replay attack also, I am thinking with HMAC but I not sure alone it will work. Moreover, I chose 4096 bit group randomly, so can I use bigger or smaller one? What impact will it cause? [link] [comments]  |
| Posted: 15 Apr 2019 07:22 AM PDT hello to all, first of all forgive me if I ask a stupid question or not relevant (I'm starting to inform myself about the world of cryptography and quantum mechanics only now). I just read an article about QRNG (quantum random number generator), the article was about a team in Geneva that would find a way to build cheap chips using the camera of a phone. Can someone give me some more information about it? And if it's really possible to make a chip by yourself Ty so much for the patient [link] [comments]  |
| How can a public key fingerprint be generated in PyNaCl? Posted: 15 Apr 2019 09:11 AM PDT |
| Link hashed encrypted data with its hashed key ? Posted: 15 Apr 2019 05:30 AM PDT I was wondering if there is a way to relate the hash of an encrypted data and the hash of the encryption key. There is a scenario where I need to verify that the key is the one used for encryption without having the encrypted data or decrypting it. [link] [comments]  |
| Posted: 14 Apr 2019 05:35 PM PDT Hey all my cryptography class is just about to wrap up with it's final exam. I learned alot and been able to implement alot of the course content as various applications. My class has ended on the RSA and Elgamal's cryptosystem, which I have built programs for key generation and communication between two key profiles. I have not been able to ask my prof yet so I thought I might reach out to you guys as to what I should go out and learn on my own. I have really enjoyed this class and the subject matter and would love to dive even deeper but I'm not sure where. Is there another cryptosystem that I need to learn, should I get into how to crack the cryptosystems I am already familiar with, or use different types of encryption to build a bigger exchange system. For instance using diffie-hellman to generate a shared key and then use that shared key with another kind of encryption? Thank you for your time! [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