Modern cryptography is all about

understanding integer mathematics

INSERT
VIDEO
HERE
 Modern cryptography is all about
understanding integer mathematics
• Discrete mathematics and abstract algebra

INSERT
VIDEO
HERE
 Modern cryptography is all about
understanding integer mathematics
• Discrete mathematics and abstract algebra
• Calculations must be exact (no round off error)

INSERT
VIDEO
HERE
 Modern cryptography is all about
understanding integer mathematics
• Discrete mathematics and abstract algebra
• Calculations must be exact (no round off error)
• Several “hard” problems to provide crypto keys
INSERT
VIDEO
HERE
 Modern cryptography is all about
understanding integer mathematics
• Discrete mathematics and abstract algebra
• Calculations must be exact (no round off error)
• Several “hard” problems to provide crypto keys
INSERT • Integers and their subsets
VIDEO
HERE
 Modern cryptography is all about
understanding integer mathematics
• Discrete mathematics and abstract algebra
• Calculations must be exact (no round off error)
• Several “hard” problems to provide crypto keys
INSERT • Integers and their subsets
VIDEO • Divisibility

HERE
 Modern cryptography is all about
understanding integer mathematics
• Discrete mathematics and abstract algebra
• Calculations must be exact (no round off error)
• Several “hard” problems to provide crypto keys
INSERT • Integers and their subsets
VIDEO • Divisibility
• Prime and composite numbers
HERE
 Modern cryptography is all about
understanding integer mathematics
• Discrete mathematics and abstract algebra
• Calculations must be exact (no round off error)
• Several “hard” problems to provide crypto keys
INSERT • Integers and their subsets
VIDEO •
•
Divisibility
Prime and composite numbers
HERE • Fundamental theorem of arithmetic
 Modern cryptography is all about
understanding integer mathematics
• Discrete mathematics and abstract algebra
• Calculations must be exact (no round off error)
• Several “hard” problems to provide crypto keys
INSERT • Integers and their subsets
VIDEO •
•
Divisibility
Prime and composite numbers
HERE •
•
Fundamental theorem of arithmetic
Greatest common divisor and relatively prime
Integer subsets need precise definitions,
unfortunately this often isn’t the case

INSERT
VIDEO
HERE
Integer subsets need precise definitions,
unfortunately this often isn’t the case
• Integers ℤ = {…, -3, -2, -1, 0, 1, 2, 3,
…}

INSERT
VIDEO
HERE
Integer subsets need precise definitions,
unfortunately this often isn’t the case
• Integers ℤ = {…, -3, -2, -1, 0, 1, 2, 3,
…}

INSERT • Positive integers ℤ+ = {1, 2, 3, …}

VIDEO
HERE
Integer subsets need precise definitions,
unfortunately this often isn’t the case
• Integers ℤ = {…, -3, -2, -1, 0, 1, 2, 3,
…}

INSERT • Positive integers ℤ+ = {1, 2, 3, …}

VIDEO • Negative integers ℤ- = {…, -3, -2, -1}

HERE
Integer subsets need precise definitions,
unfortunately this often isn’t the case
• Integers ℤ = {…, -3, -2, -1, 0, 1, 2, 3,
…}

INSERT • Positive integers ℤ+ = {1, 2, 3, …}

VIDEO • Negative integers ℤ- = {…, -3, -2, -1}

HERE • Nonnegative integers ℤ0+ = {0, 1, 2, 3, …}

Integer subsets need precise definitions,
unfortunately this often isn’t the case
• Integers ℤ = {…, -3, -2, -1, 0, 1, 2, 3,
…}

INSERT • Positive integers ℤ+ = {1, 2, 3, …}

VIDEO • Negative integers ℤ- = {…, -3, -2, -1}

HERE • Nonnegative integers ℤ0+ = {0, 1, 2, 3, …}

• Nonpositive integers ℤ0- = {…, -3, -2, -1, 0}

Divisibility involves some fine print

INSERT
VIDEO
HERE
Divisibility involves some fine print
• a|b (read “a divides b”)

INSERT
VIDEO
HERE
Divisibility involves some fine print
• a|b (read “a divides b”)
• b = ac for some integer ‘c’

INSERT
VIDEO
HERE
Divisibility involves some fine print
• a|b (read “a divides b”)
• b = ac for some integer ‘c’
• a is a divisor of b
INSERT
VIDEO
HERE
Divisibility involves some fine print
• a|b (read “a divides b”)
• b = ac for some integer ‘c’
• a is a divisor of b
INSERT • Divisibility is a statement, not an operation

VIDEO
HERE
Divisibility involves some fine print
• a|b (read “a divides b”)
• b = ac for some integer ‘c’
• a is a divisor of b
INSERT • Divisibility is a statement, not an operation
• Sign has no effect: 6|42, -5|35, 9|-27, -7|-21
VIDEO
HERE
Divisibility involves some fine print
• a|b (read “a divides b”)
• b = ac for some integer ‘c’
• a is a divisor of b
INSERT • Divisibility is a statement, not an operation
• Sign has no effect: 6|42, -5|35, 9|-27, -7|-21
VIDEO • Technically speaking about zero

HERE
Divisibility involves some fine print
• a|b (read “a divides b”)
• b = ac for some integer ‘c’
• a is a divisor of b
INSERT • Divisibility is a statement, not an operation
• Sign has no effect: 6|42, -5|35, 9|-27, -7|-21
VIDEO • Technically speaking about zero
• Everything, including zero, divides zero
HERE
Divisibility involves some fine print
• a|b (read “a divides b”)
• b = ac for some integer ‘c’
• a is a divisor of b
INSERT • Divisibility is a statement, not an operation
• Sign has no effect: 6|42, -5|35, 9|-27, -7|-21
VIDEO • Technically speaking about zero
• Everything, including zero, divides zero
HERE • Zero only divides zero
Divisibility involves some fine print
• a|b (read “a divides b”)
• b = ac for some integer ‘c’
• a is a divisor of b
INSERT • Divisibility is a statement, not an operation
• Sign has no effect: 6|42, -5|35, 9|-27, -7|-21
VIDEO • Technically speaking about zero
• Everything, including zero, divides zero
HERE • Zero only divides zero
• But division by zero is ALWAYS undefined!
A prime number is any number greater than
one divisibly only by one and itself

INSERT
VIDEO
HERE
A prime number is any number greater than
one divisibly only by one and itself
• A number divisibly only by 1 and itself – NOT!

INSERT
VIDEO
HERE
A prime number is any number greater than
one divisibly only by one and itself
• A number divisibly only by 1 and itself – NOT!
• Prime numbers need to be positive

INSERT
VIDEO
HERE
A prime number is any number greater than
one divisibly only by one and itself
• A number divisibly only by 1 and itself – NOT!
• Prime numbers need to be positive
• 1 is not prime
INSERT
VIDEO
HERE
A prime number is any number greater than
one divisibly only by one and itself
• A number divisibly only by 1 and itself – NOT!
• Prime numbers need to be positive
• 1 is not prime
INSERT • A prime number is a positive integer greater than
VIDEO one whose only positive divisors are 1 and itself.

HERE
A prime number is any number greater than
one divisibly only by one and itself
• A number divisibly only by 1 and itself – NOT!
• Prime numbers need to be positive
• 1 is not prime
INSERT • A prime number is a positive integer greater than
VIDEO one whose only positive divisors are 1 and itself.

HERE • Composite: positive integer > 1 that is not prime

A prime number is any number greater than
one divisibly only by one and itself
• A number divisibly only by 1 and itself – NOT!
• Prime numbers need to be positive
• 1 is not prime
INSERT • A prime number is a positive integer greater than
VIDEO one whose only positive divisors are 1 and itself.

HERE • Composite: positive integer > 1 that is not prime

• 0 and 1 are neither prime nor composite
Fundamental Theorem of Arithmetic:
Prime-number factorization is unique

INSERT
VIDEO
HERE
Fundamental Theorem of Arithmetic:
Prime-number factorization is unique
• Any integer greater than 1:

INSERT
VIDEO
HERE
Fundamental Theorem of Arithmetic:
Prime-number factorization is unique
• Any integer greater than 1:
• Can be written as a unique product of primes

INSERT
VIDEO
HERE
Fundamental Theorem of Arithmetic:
Prime-number factorization is unique
• Any integer greater than 1:
• Can be written as a unique product of primes
• Ordering doesn’t count
INSERT
VIDEO
HERE
Fundamental Theorem of Arithmetic:
Prime-number factorization is unique
• Any integer greater than 1:
• Can be written as a unique product of primes
• Ordering doesn’t count
INSERT • IF 1 were prime
VIDEO
HERE
Fundamental Theorem of Arithmetic:
Prime-number factorization is unique
• Any integer greater than 1:
• Can be written as a unique product of primes
• Ordering doesn’t count
INSERT • IF 1 were prime
VIDEO • 12 = 2·2·3 = 1·2·2·3 = 1·1·1·2·2·3

HERE
Fundamental Theorem of Arithmetic:
Prime-number factorization is unique
• Any integer greater than 1:
• Can be written as a unique product of primes
• Ordering doesn’t count
INSERT • IF 1 were prime
VIDEO • 12 = 2·2·3 = 1·2·2·3 = 1·1·1·2·2·3

HERE • No prime factorization for 0, 1, or negatives

Greatest common divisor, gcd(a,b), is largest
integer that divides both ‘a’ and ‘b’

INSERT
VIDEO
HERE
Greatest common divisor, gcd(a,b), is largest
integer that divides both ‘a’ and ‘b’
• The integer ‘c’ is a common divisor of ‘a’ and ‘b’ if

INSERT
VIDEO
HERE
Greatest common divisor, gcd(a,b), is largest
integer that divides both ‘a’ and ‘b’
• The integer ‘c’ is a common divisor of ‘a’ and ‘b’ if
• a = c·m and b = c·n for some ‘m’ and ‘n’

INSERT
VIDEO
HERE
Greatest common divisor, gcd(a,b), is largest
integer that divides both ‘a’ and ‘b’
• The integer ‘c’ is a common divisor of ‘a’ and ‘b’ if
• a = c·m and b = c·n for some ‘m’ and ‘n’
• OR: if c|a and c|b
INSERT
VIDEO
HERE
Greatest common divisor, gcd(a,b), is largest
integer that divides both ‘a’ and ‘b’
• The integer ‘c’ is a common divisor of ‘a’ and ‘b’ if
• a = c·m and b = c·n for some ‘m’ and ‘n’
• OR: if c|a and c|b
INSERT • gcd(a,b) is the largest common divisor of ‘a and ‘b’
VIDEO
HERE
Greatest common divisor, gcd(a,b), is largest
integer that divides both ‘a’ and ‘b’
• The integer ‘c’ is a common divisor of ‘a’ and ‘b’ if
• a = c·m and b = c·n for some ‘m’ and ‘n’
• OR: if c|a and c|b
INSERT • gcd(a,b) is the largest common divisor of ‘a and ‘b’
VIDEO • gcd(a,b) ≥ 1

HERE
Greatest common divisor, gcd(a,b), is largest
integer that divides both ‘a’ and ‘b’
• The integer ‘c’ is a common divisor of ‘a’ and ‘b’ if
• a = c·m and b = c·n for some ‘m’ and ‘n’
• OR: if c|a and c|b
INSERT • gcd(a,b) is the largest common divisor of ‘a and ‘b’
VIDEO • gcd(a,b) ≥ 1
• By convention, ‘a’ and ‘b’ can’t both be zero
HERE
Greatest common divisor, gcd(a,b), is largest
integer that divides both ‘a’ and ‘b’
• The integer ‘c’ is a common divisor of ‘a’ and ‘b’ if
• a = c·m and b = c·n for some ‘m’ and ‘n’
• OR: if c|a and c|b
INSERT • gcd(a,b) is the largest common divisor of ‘a and ‘b’
VIDEO • gcd(a,b) ≥ 1
• By convention, ‘a’ and ‘b’ can’t both be zero
HERE • gcd(a,b) = 1 → ‘a’ and ‘b’ are “relatively prime”
 In review…

INSERT
VIDEO
HERE
 In review…
• Integers and their subsets

INSERT
VIDEO
HERE
 In review…
• Integers and their subsets
• Divisibility

INSERT
VIDEO
HERE
 In review…
• Integers and their subsets
• Divisibility
• Prime numbers
INSERT
VIDEO
HERE
 In review…
• Integers and their subsets
• Divisibility
• Prime numbers
INSERT • Fundamental theorem of arithmetic

VIDEO
HERE
 In review…
• Integers and their subsets
• Divisibility
• Prime numbers
INSERT •
•
Fundamental theorem of arithmetic
Greatest common divisor
VIDEO
HERE
 In review…
• Integers and their subsets
• Divisibility
• Prime numbers
INSERT •
•
Fundamental theorem of arithmetic
Greatest common divisor
VIDEO • Relatively prime

HERE
 In review…
• Integers and their subsets
• Divisibility
• Prime numbers
INSERT •
•
Fundamental theorem of arithmetic
Greatest common divisor
VIDEO • Relatively prime

HERE • Definitions in different source may not agree

 In review…
• Integers and their subsets
• Divisibility
• Prime numbers
INSERT •
•
Fundamental theorem of arithmetic
Greatest common divisor
VIDEO • Relatively prime

HERE • Definitions in different source may not agree

• Zero and one should be considered carefully