Algorithmic Number Theory and Cryptography (CS 303)

 Announcments  Lectures  Programs  Course Resources   Assignments and Solutions  Grading Policy
Course Description
Covers fundamental algorithms for integer arithmetic, greatest common divisor calculation, modular arithmetic, and other number theoretic computations. Algorithms are derived, implemented and analyzed for primality testing and integer factorization. Applications to cryptography are explored including symmetric and public-key cryptosystems. A cryptosystem will be implemented and methods of attack investigated.
Course Goals
To be able to implement and analyze algorithms for integer factorization and primality testing. To be able to use a system like Maple to explore concepts and theorems from number theory. To understand fundamental algorithms from symmetric key and public key cryptography.
Course Objectives
Audience
Undergraduate computer science, computer engineering, mathematics, and students interested in security, cryptography and applied number theory. The course will cover both the underlying mathematical theory and practice as algorithms will be implemented and analyzed (the Maple computer algebra system will be used for implementation of algorithms and exploration of concepts). For computer science students, the course counts towards the numeric and symbolic computing and computer and network security tracks.
Prerequisites
Undergraduate data structures course (CS 260)
Courses in linear algebra (MATH 201 or equivalent), discrete mathematics (MATH 221 or equivalent).
Instructor
Jeremy Johnson
Office: 139 University Crossings
phone: (215) 895-2893
e-mail: jjohnson AT cs DOT drexel DOT edu
office hours: M 3-4 and R 2-3 (UC 139). Additional hours by appointment.
TA
None
Office: (CS Student Resource Center)
e-mail:
Meeting Time
TR 12:30-2:00 in Univ. Crossings 153
Course Mailing List
See Piazza Discussion Forum for announcements and to ask questions and discuss course material.

Please use Piazza for questions and discussions related to the course. If you know the answer to someone's question, please feel free to jump in, as long as well it is not an answer to a homework problem. You should check the discussion and announcements regularly. Please do NOT post answers to homework.
Textbook
  1. Jeffrey Hoffstein, Jill Pipher, and Joseph Silverman, An Introduction to Mathematical Cryptography, Springer, 2008.
  2. Every student must have access to Maple. Course notes will be provided on the web page as Maple worksheets that can not be read without Maple. Maple is available in the CS labs as well as Drexel labs, and is available for free to Drexel students as part of the campus site license.
  3. Students will be required to read several additional papers.


Topics

  1. Maple Computer Algebra System
  2. Integer and polynomial arithmetic
  3. Euclidean algorithm and continued fractions
  4. Modular Arithmetic, Fermat's theorem, Chinese Remainder Theorem
  5. Symmetric key cryptosystems (DES, AES)
  6. Public-key cryptosystems (RSA, El Gamel)
  7. Coin flipping protocols (Blum)
  8. Primality testing
  9. Algorithms for integer factorization


Grading

  1. Class Participation (25%)
  2. Five Homework assignments (75%)
Assignments will be returned on a regular basis to provide feedback to students. All students must do their own work. Any violation of this will result in a zero grade for the assignment. A second violation will lead to an F for the course.

Grades are based on a curve with the mean normalized to a B provided the mean performance shows competency of the material.

Resources

Reference Books
  1. Maple Getting Started Guide.
  2. Maple Users Manual.
  3. Maple Introductory Programming Guide.
  4. Maple Advanced Programming Guide.
Web Pages
  1. Waterloo Maple
  2. Maple Student Center
  3. Maple Essentials
  4. Maple Programming
  5. Maple Application Center
  6. SymbolicNet -- Symbolic Mathematical Computation Information Center
  7. The Prime Pages
  8. GIMPS: The Great Internet Mersenne Prime Search


Look Here for Important Announcements

See Piazza Discussion Forum.


Lectures

This list is subject to change.
  1. Week 1 (Introducition - Chapter 1)
    1. April 2, 2013 (Introduction to Cryptography and Cryptanalysis)
    2. April 4, 2013 (Introduction to Modern Cryptography)
  2. Week 2 (Modular Arithmetic - Chapter 1 )
    1. April 9, 2013 (The Euclidean Algorithm)
    2. April 11, 2013 (Modular Arithmetic and Fast Powering)
  3. Week 3 (Linear Algebra and Cryptanalysis - Chapter 1)
    1. April 16, 2013 (Modular Arithmetic and Fast Powering)
    2. April 18, 2013 (Linear Algebra and Hill Cyphers)
  4. Week 4 (RSA - Chapters 1 and 3)
    1. April 23, 2013 (RSA Public Key Encryption)
    2. April 25, 2013 (Timing Attacks on RSA)
  5. Week 5 (Diffie-Hellman Key Exchange - Chapter 2)
    1. April 30, 2013 (El Gamal Public Key Encryption and Diffie-Hellman Key Exchange)
    2. May 1, 2013 (Collision Algorithms and the Discrete Log Problem)
  6. Week 6 (Primality Testing - Chapter 3)
    1. May 6, 2013 (Unique Factorization, the Sieve of Eratosthenes and the Prime Number Theorem)
    2. May 8, 2013 (Strong Pseudoprimes and a Probabalistic Primality Test)
  7. Week 7 (Probabalistic Encryption - Chapter 3 and 8)
    1. May 13, 2013 (Quadratic Reciprocity and the Solovay-Strassen Primality Test)
    2. May 15, 2013 (Blum Coin Flipping Protocol and Goldwasser-Micali Probabalistic Encryption)
  8. Week 8 (Integer Factorization - Chapter 3)
    1. May 20, 2013 (Introduction to Integer Factorization Algorithms)
    2. May 22, 2013 (Introduction to Integer Factorization Algorithms)
  9. Week 9 (Integer Factorization - Chapter 3)
    1. May 27, 2013 (Dixon's Algorithm)
    2. May 29, 2013 (Dixon's Algorithm)
  10. Week 10 (Attacks on RSA 8)
    1. April 18, 2013 (Polyalphabetic Substitution Cyphers)
    2. June 6, 2013 (Timing Attack)


Programs and Worksheets


Assignments and Exams