Saturday, December 1, 2012

16.4, due Monday Dec 3rd

1. The hard part about this was following the example all the way through. It just took a little extra time to figure out what was going on.

2. The interesting part was how secure systems can be mod 2 or mod 2^n. I thought this would either decrease the security of the system, or make it difficult to represent points, but both challenges are overcome.

No comments:

Post a Comment