Wow, this class threw me for a loop. Very interesting class, and Will is great, but I was not expecting this class to involve what it did. Will is a great lecturer and very accommodating. He will do these marathon review sessions for each exam that are very helpful. He also made the decision to let us use a double sided formula sheet for the final and a scientific calculator (get one that has a “mod” function or “remainder” function on it). He’s also extremely fair with grades. I struggled a lot in this class and still got a B- so that should hopefully encourage you. I will say though, if you’re going to take this class, get good at number theory (modular arithmetic, prime numbers, etc), Python, and maybe some Abstract Algebra (MATH 110A, 110B and maybe even 110C) before you take this class. The only prerequisite for this class is MATH 115A (Linear Algebra), but I think you should know how to use Python, maybe have taken MATH 11N, MATH 111, MATH 110A, MATH 110B, or some number theoretical algebraic class or lots of self study on it. I would imagine if the wrong professor taught this class (Will is great, so not him) students would be in for a rude awakening drowning in Python homework and a bunch of number theory that they never learned. You also get three grading schemes and an optional final paper/project you can submit at the end of the class on a topic of your choice regarding cryptology stuff, ranging from more abstract mathematical stuff to more applied, concrete examples like the Enigma machine or blockchain (he advises against blockchain cause it’s very advanced and easy to mess up). So, I’d say if you’re really good with Number Theory, Algebra, Python, and maybe just math in general, you’ll really enjoy this class. If those things are brand new to you like it was for me, I think you’ll still be okay, but you’ll hurt a little bit lol. I’m still really glad I took the class. One of the most interesting, stimulating classes I’ve ever taken here at UCLA. Probably wouldn’t take again until I took MATH 11N, MATH 110A and MATH 111.

Will teaches very clearly and he gave us programming assignments from which we can actually experience the beauty of cryptography.

Tests:
1 Midterm, 1 Final.
The tests can be a little bit long, but they are easy if you understand the material.

Homework:
Homework can be a headache for someone who knows nothing about Math 110A, like me, but if you are willing to spend more time, you are totally fine.

Project:
Will asked us to dive into a cryptographic field that is not covered in class, and this project basically gave us a taste of researches.

However, this course should have Math 110A as a prerequisite since we spent so much time on number theory and finite fields. We could totally spend such time on actual cryptographic applications, like elliptic curves, pseudorandom generators, etc.. I hope the department can change the prereq and make this course better.