1. (Difficult): The bit commitment concept makes sense, but the details of bit b=x1 is a little fuzzy. An example would be nice.
Why wouldn't a solution to the decision Diffie-Hellman problem give a a solution to the computational Diffie-Hellman problem? Aren't they equivalent problems?
I'm not following the proofs for the propositions relating the two Diffie-Hellman problems and the ElGamal public key cryptosystem. Another go through it asking questions as a class would be helpful.
2.(Reflection): I really like the football analogy. Makes sense.
Also, I still think discrete logs are harder than big primes and RSA.
No comments:
Post a Comment