Go to Main Content

Georgetown University

HELP | EXIT

Detailed Course Information

 

Fall 2017
Oct 19, 2017
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

MATH 211 - Intro to Cryptography
In this introductory course we begin by looking at how the ancient Roman military send secret messages.  We then survey cryptography from Roman times up to today's high tech world. Students will learn how to encrypt messages and how to attempt to break codes.  We will discuss the efficiency and security level of different encryption methods.  To make the discussion rigorous, we will need tools/concepts/results from
mathematics.  

Mathematical content: mappings and inverse mappings, modular arithmetic, the additive group Z/n, the multiplicative group Z*/n, Euler's phi function, Fermat's Little theorem and Euler's generalization, primitve roots, discrete logarithms.

Cryptographic content: classical ciphers and their decryption (shift, affine, and Vigenere ciphers), key exchange protocols (main
example: Diffie-Hellman), public key ciphers (main example: RSA).

An important mathematical thrust will be to show students that there are
alternative arithmetic systems in which familiar objects such as inverses, products, and logarithms have strange properties, and that these are the right tools for cryptography.

3.000 Credit hours
3.000 Lecture hours
0.000 Lab hours

Levels: Undergraduate
Schedule Types: Lecture

Mathematics Department

Course Attributes:
Mean Grade is Calculated

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.2