Cryptography
30 Aug 2021
Notes from MATH 470 — Communications and Cryptography at Texas A&M.
Based off of lectures by Dr. Josiah Park, and An Introduction to Mathematical Cryptography by J. Hoffstein, J. Pipher, and J.H. Silverman.
Notation
- and are used interchangably; as are and
- is sometimes used in place of or , which is disambiguated based on context
- are the natural numbers, defined without 0.
- are the set of primes
- The interval notation defines the set of integers between and with brackets for inclusivity or parentheses for exclusivity[a].
§ Comments
(3 Jan 2025) I've been updating my site, and decided to update some pages as I transfer them.
Over the years I've come to prefer the set notation even if it means that I have to explicitly state instead of using a parenthesis for when something is exclusive.
^a: Not everything has been touched in my update; some portions of these notes may use the interval notation, and in others the set notation.
Contents
- Number Theory: Modular Arithmetic
- Intermezzo: Algebraic Structures
- Number Theory: GCD, Euclid, Diophantus, and Bézout
- Number Theory: Exponentiation with Fast Powering and Montgomery Ladder
- Number Theory: Euler's and Carmichael's Totient, Euler's Theorem
- Number Theory: Discrete Log Problem and Primitive Roots
- Diffie-Hellman Key Exchange
- Elgamal Cryptosystem
-
Discrete Logarithm in : Pohlig-Hellman
-
Discrete Logarithm in : is a Prime Power
-
Discrete Logarithm in : Shank's Baby-Step Giant-Step
-
Discrete Logarithm in : Index Calculus Method
- RSA Cryptosystem
- Primality: Naïve Test
-
Primality: Fermat Test and Carmichael Numbers
- Primality: Miller-Rabin
- Primality: Baillie-PSW
-
Factorization: Pollard's method
-
Factorization: Pollard's method
- Factorization: Quadratic Sieve
- Factorization: General Number Field Sieve
-
Elliptic Curves over
- Factorization: Lenstra Elliptic-Curve Factorization
- Elliptic Curves: ECDH, EC Elgamal, Curve25519
- Signature Algorithms: RSA and DSA
- Signature Algorithms: ECDSA
-
Discrete Logarithm in