I am still surprised by the nature of one way functions. I'm a little confused though as to how the exponential hash function example provides a way for us to solve the discrete log problem, and how the parts of it are so correlative to it. I'm not sure if they're providing a way to solve that is computationally unfeasible or just unlikely to occur.
Hash functions are quite interesting because they are not technically bijections, but they behave like them, and it is in computational power that they become difficult to break. It's interesting how we can use computational prowess to get around logical difficulties.
No comments:
Post a Comment