Difficult:
I think I need an example of how a hash function can be used as an encryption process. It seems like we are XORing different values to obtain our ciphertext. Also the text states that "the idea of using a hash function to create a an encryption procedure can be modified to create an encryption procedure." I'm curious of how this would work and what we would have to do to make it like that.
Reflective:
I think that it's interesting how different approaches to the same problem can still yield a similar result such as the birthday attack and Baby Step Giant Step attack. Both are finding the discrete logarithm and even though they came from different background they still have almost the same methodology.
No comments:
Post a Comment