Sunday, November 25, 2012

Section 16.1, due November 26

The most difficult part of the section was the part about the addition law for elliptic curves.  It wasn't super difficult to understand, but an example would be very helpful.

I think the most important part of the section, at least as it pertains to cryptography, is the fact that elliptic curve systems can do with 313 bit keys what certain conventional systems can only do with 4096 bit keys.  The is vast improvement in efficiency, made possible by a creative cryptosystem built on powerful mathematics.

No comments:

Post a Comment