1. (Difficult) I was confused about the prepositions in Section 7.5.1. Those would be great to go over in class. I understood the Diffie-Hellman problems, but the propositions and proofs were confusing to me. Is the Diffie-Hellman Key Exchange as secure as RSA? Is it more secure?
2. (Reflective) It initially surprised me that the discrete logarithm problem was so hard, because initially it looks so simple. From these section, we see that this method of encryption and decryption is secure as far as we know. I wonder how it compares to RSA though, as I asked above. Is discrete logs as secure or more secure than RSA as far as we know currently?
The bit commitment made a lot of sense in real-world application. There are sometimes that predictions need to be made, but without a secure way to ensure that the prediction was not altered could present problems in the future.
No comments:
Post a Comment