Last offered Spring 2013
Cross Listed as MATH316
Living in the information age, we find ourselves depending more and more on codes that protect messages against either noise or eavesdropping. This course examines some of the most important codes currently being used to protect information, including linear codes, which in addition to being mathematically elegant are the most practical codes for error correction, and the RSA public key cryptographic scheme, popular nowadays for internet applications. We also study the standard AES system as well as an increasingly popular cryptographic strategy based on elliptic curves. Looking ahead by a decade or more, we show how a quantum computer could crack the RSA scheme in short order, and how quantum cryptographic devices will achieve security through the inherent unpredictability of quantum events.
Class Format: lecture
Requirements/Evaluation: evaluation will be based on homework sets and exams
Additional Info:
Additional Info2:
Prerequisites: PHYS 210 or MATH 250 (formerly 211) (possibly concurrent) or permission of the instructors;
Enrollment Preference: discretion of the instructors
Department Notes: students not satisfying the course prerequisites but who have completed MATH 200 (formerly 251) or MATH 209 are particularly encouraged to ask to be admitted
Material and Lab Fees:
Distribution Notes:
Divisional Attributes: Division III,Quantitative and Formal Reasoning
Other Attributes:
Enrollment Limit: 50
Expected Enrollment: 35
Class Number: 3223
| CLASSES | ATTR | INSTRUCTORS | TIMES | CLASS NUMBER |
|---|---|---|---|---|
| PHYS316 LEC Protecting Information (Q) | ![]() ![]() |
Susan R. Loepp |

