1. The was the first time I felt that there was anything truly hard to follow. The proof provided for breaking LSFRs was hard for me to follow. I get lost after we have proved that det (Mn) = 0 (mod 2). I guess I will have to wait to we discuss it in class to really understand it.
2. The most interesting part is what the begining of the section 2.11 talks about. The fact that their is often a trade off between security and usability/speed. I think this is a subject that might be very important for the future of cryptographic methods. We need to focus on secure algorithms that are both fast and accessable.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment