Nothing was really hard to understand in these sections. They were more explanatory then they involved math and thus were not hard. Probably the hardest would have been following the explentation of the discrete logorithm, but I have already learned about that.
What is cool to me is the discrete logarithmic problem. It provides us with another unique way to generate keys that are compitationally very hard to break, but very easy to create. The use of the duffie-helman encryption based on this also interests me.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment