The first two conversions were pretty straight forward. Understanding the Translation for ElGamal transformations was a little harder, but overall it was pretty followable. It works in nearly exactly the same function, we just swap out the necessary function.
I really like how well the elliptic curves lend them selves really well to problems with discrete logs. This makes implementing them in systems all the easier.
Friday, December 4, 2009
Section 16.4, December 7
The section was a little hard for me to see applicability. The number of points that we can generate are very few in number. I guess we still have a lot more in GF(2^8), but it still seems rather small. I guess I must not be fully grasping the concept.
It was cool to see us returning to items in base 2 seeing as that is what computers use.
It was cool to see us returning to items in base 2 seeing as that is what computers use.
Tuesday, December 1, 2009
Section 16.2, December 2
The hardest part to follow was how we were going to represent plain test. It seems like a lot of work to encode plain test, but I can only guess that it must be very fast to do on a computer. It is annoying that it is only probabilistic.
The coolest part was to find that there is a law about elliptic curves that is analagous to solving discrete logarithms. This helps me see how to use Elliptic curves in cryptography.
The coolest part was to find that there is a law about elliptic curves that is analagous to solving discrete logarithms. This helps me see how to use Elliptic curves in cryptography.
Section 16.1, November 30
I would say the hardest part of the whole section was wrapping my mind around the section as a whole. No one part of it was really that bad, but there were a lot of little different things. Actually on second though I did have a hard time initially following how we were going to find the tangent line. The whole derivation thing through me off.
The coolest idea in the whole section was that we can always find a third point on the curve based on the two points that we are given.
The coolest idea in the whole section was that we can always find a third point on the curve based on the two points that we are given.
Subscribe to:
Posts (Atom)