Sections 12.1 and 12.2, due Monday November 15

1. (Difficult) After the example of the Shamar threshold scheme, there was an explanation of why t-1 people could not get the secret. That explanation was confusing. Also, could you explain the Lagrange interpolation polynomial?

2. (Reflective) This is an interesting problem. I had never thought about distributing parts of a key, so that a certain number of people are needed to find the secret. It makes a lot of sense though because it spreads responsibility among various people and guarantees that not just one person can find the secret. What are other applications of the threshold scheme that weren't in the book? It kind of reminds me how when you take out money from a bank for a club or an organization, two signatures are often required or two people must be present to do so.