The most difficult thing for me was understanding the three-pass protocol. It looks like their taking primes to powers now that I'm looking at it. Okay, now that I'm blogging about it and thinking about it more, it's starting to make sense. Alrighty then. It's Euler's phi function that's tripping me up the most now. Do we need the prime factorization of the number of do it?
What was interesting to me was the concept of primitive roots. It seems related to the multiplicative generators we found in our modular arithmetic with polynomials. It seems to me that when we were finding generators, we were really finding primitive roots of the polynomials. It's nice to see the numerical equivalent of these roots. I'm excited to learn more about these primitive roots. And while the three-pass protocol was a little hard to decipher, it's really quite clever now that I think about it. I'm impressed with those who came up with it, especially since it allows Alice and Bob to exchange a key over an open channel.
No comments:
Post a Comment