1. The most difficult concepts I'm seeing right now is keeping all the terminology and vocabulary sorted out. There are so many variations on the word "text," (plaintext, ciphertext, known plaintext, chosen ciphertext, etc.). I'm having difficulty understanding Kerckhoffs's principle. What does it mean for the security of a system to be based on the key and not on the obscurity of the algorithm? If we assume that Eve has knowledge of the algorithm used to perform encryption, why doesn't that defeat the purpose of encryption?
2. The most interesting part of the reading to me were the historical examples given. I understand there is a book that would relate to this subject, The Codebook. I'm going to look into this.
I've taken Math 371 (Abstract Algebra) so I'm familiar with the Euclidean algorithm. The thing I was wondering during crypto reading was, "How is this going to fit into ciphering?" I've known that math plays a huge part in programming and encryption, but how does it specifically play in? I imagine that since algorithms are used to encrypt and decrypt, perhaps Euclidean algorithm is a good candidate for doing such a thing.
No comments:
Post a Comment