MATH 316, Applied Math and Modeling II (Cryptology)

Course Documents

• Syllabus
• Day-by-day plans, with assignments: Unit 1, Unit 2, Unit 3, Unit4
• Homework Additions and Modifications
• Guidelines for Written Work

Reading Questions

• Section 1.1, Shift Ciphers
• Section 1.2, Reduction/Division Algorithm
• Section 1.3, The One-Time Pad
• Sections 1.4-1.5, Divisibility, Multiplicative Inverses
• Section 1.6, The Integers mod m
• Section 1.7, The Affine Cipher
• Section 2.1, Counting
• Section 2.2, Basic Ideas
• Sections 2.3-2.4, Statistics of English, Attack on the Affine Cipher
• Section 4.1, The Vigenere Cipher
• Section 4.4, Expected Values
• Section 4.5, The Friedman Attack
• Section 7.1, Trapdoors and Section 7.2A, The RSA Cipher
• Section 7.2B, Security of the RSA Cipher
• Section 7.3, Primitive Roots, Discrete Logs
• Section 7.5, ElGamal Cipher
• Sections 13.1-13.2, Fermat Pseudoprimes, Non-prime Pseudoprimes
• Sections 13.3-13.4, Euler Pseudoprimes, The Solovay-Strassen Test
• Sections 13.5-13.6, Strong Pseudoprimes, The Miller-Rabin Test
• Sections 14.1-14.2, Basic Public-Key Protocol, Secret-Sharing
• Section 14.3, Oblivious Transfer
• Section 14.4, Zero Knowledge Proofs
• Sections 16.1-16.3, Pseudorandom Number Generators, Linear Congruential Generators
• Section 16.4, Linear Feedback Shift Registers
• Section 16.6, Blum-Blum-Shub Generator
• Section 18.1, Pollard Rho Method
• Section 18.2, Pollard p-1 Method
• Section 18.3, Pocklington-Lehmer Criterion
• Section 18.4, Strong Primes
• Section 18.5, Primality Certificates
• Sections 9.1-9.4, Factoring Special Expressions
• Section 9.5, Exponentiation Algorithm
• Sections 12.1-12.3, Euler Criterion, Quadratic Symbols
• Section 19.2, Random Squares Factoring
• Section 19.3, Gaussian Elimination, Dixon Algorithm
• Section 19.4, Non-Sieving Quadratic Sieve
• Section 19.5, Continued Fraction Sieve, Quadratic Sieve

Back to Amy's website.