CS1800 Discrete Structures
Module 2: Cryptography
Integers and Modular Arithmetic
Cryptography and Modular Arithmetic
2.01
Simple Shift Ciphers, Encoding and Intro to mod
2.02
The mod Function
2.03
Simple Substitution Ciphers, Linear Ciphers
2.04
Linear Ciphers - Part 2 - choosing
m
2.05
Modular Arithmetic
2.06
Powers mod n
Integers and Division
2.07
Division, Composites and Primes
2.08
Prime Number Decomposition
2.09
Greatest Common Divisor and Least Common Multiple
2.10
Euclidean Algorithm
2.11
Extended Euclidean Algorithm and Inverses mod n
The RSA (Rivest-Shamir-Adelman) cryptosystem
The RSA (Rivest-Shamir-Adelman) cryptosystem
This is also section 6.8 The RSA (Rivest-Shamir-Adelman) cryptosystem in the text.
The Mathematical Guts of RSA Encryption
Still Guarding Secrets after Years of Attacks, RSA Earns Accolades for its Founders
Module 1: Computers and Computing: Numbers, Circuits, and Logic
Module 3: Combinatorics Sets, Counting, and Probability
Module 4: Module 4: Algorithmic Analysis: Searching and Sorting
© Harriet Fell 2014