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.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment