MATH 582 - Number Theory and Cryptography
Show Details for Open Courses Only
Description
Hours: Three hours lecture per week Prerequisites: Admission to the Computer Science or Mathematics Graduate Program Topics include: Number theory, finite fields, polynomial rings, elliptic curves, public-key cryptography, zero-knowledge protocols, primality testing, factorization algorithms and applications.
Units: 3.00
Grading: Letter Grade
Session | Section | Class # | Type | Days | Time | Location | Instructor | Course Details [Key] |
---|---|---|---|---|---|---|---|---|
E1 | 1 | 2472 | LEC | W | 6:00 PM - 8:50 PM | Bell Tower 2352 | Brian Sittinger |
![]() ![]() ![]() ![]() |
Key for Course Detail Icons
= Course Open
= Course Closed
= Course Details
= Textbook Info
= General Education
= Extended University
= Service-Learning
= In Person Course
= Asynchronous Online Course
= Synchronous Online Course
= Synchronous/Asynchronous Course
= No Cost Course Materials
= Low Cost Course Materials