The most difficult part of the reading was the part about the method to find the secret message using the of the message pairs and the Lagrange interpolating polynomial. An in class example will help a lot.
Secret splitting is a really interesting principle, and one that I had never really thought about. It can be implemented pretty simply and it would be infeasible to find the secret message without the correct amount of people. Also, I learned about Lagrange polynomials in my numerical methods not too long ago. I definitely didn't think there would be an interesting cryptographic application of Lagrange interpolation.
No comments:
Post a Comment