MATH 303 - FALL 2009

Instructor: Professor David Singer
Office: Yost 307a
Extension: x2892
E-mail: david.singer@case.edu

Text: A Friendly Introduction to Number Theory, 3rd Edition, by Joseph H. Silverman, 2005. (ISBN 0-13186137-9)

Office Hours. My official hours are posted at the link. I am also available at other times by appointment or you may drop by my office. You are always welcome!

Syllabus: The general goal of the course is to introduce basic ideas in number theory and their application to modern cryptology. Here is an approximate list of the topics to be covered:

1. The Euclidean Algorithm
2. Unique Factorization
3. Prime Numbers
4. Congruences and Divisibility
5. Fermat's Little Theorem
6. Pseudoprimes and primality testing
7. Groups and the Euler phi function
8. Euler's Theorem, and Powers of Integers
9. Quadratic residues and reciprocity
10. Finite fields
11. Introduction to cryptographic systems
12. Public Key Crypto-systems

Course Information:(DATES MAY CHANGE) There will be regular homework assignments, which will count for 30% of the grade. Each group of two or three students will prepare a written project on a topic of their choice relating to the subject matter of the course, which will count for 30% of the grade. The topic should be selected by Monday, September 28, 2009. A rough draft and progress report on the project will be due on October 16, 2009. A presentation (about 40 - 50minutes) will be made by each group sometime during the term. The absolute deadline for written reports is December 4. There will be a midterm exam in class (tentatively) scheduled for Monday, October 12, 2009, which will count for 20%. The final exam will count for the remaining 20%.

Phone: (216)368-2892

Fax: (216)368-5163

This page last changed on Monday, June 1, 2009
das5@case.edu -- About this server -- Copyright 2009 CWRU -- Unauthorized use prohibited