Discrete Mathematics
Hans Georg Schaathun

Public Key Cryptography

Extra material (Week 4-5)

Week 4 Revision Week 4 Revision with solutions
Week 5 Revision Week 5 Revision with solutions
Modular Equations Video Time Slides Stein et alRosen
Uniqueness of Solutions MPEG4/ OGG 6:34 pre-slides
post-slides
p. 106-109 p. 272-275
Modular and Non-modular Equations MPEG4/ OGG 6:45 PDF p. 109-110 ??
Highest Common Factor and Euclid's Algorithm Video Time Slides Stein et alRosen
Highest Common Factor MPEG4/ OGG 7:12 PDF p. 110-111 p. 263-265
Euclid's Division Theorem MPEG4/ OGG 10:14 pre-slides
post-slides
p. 111-114 p. 239
Proof of Euclid's Algorithm MPEG4 / OGG 9:55 PDF ?? p. 266
Extended Euclid's Algorithm Video Time Slides Stein et alRosen
Extended Euclid's Algorithm MPEG4 / OGG 15:38 pre-slides
post-slides
p. 115-119 p. 268+,272 (exercise)
Extended Euclidean Algorithm by Gary Rubinstein YouTube 20:56
How To Find The Inverse of a Number ( mod n ) - Inverses of Modular Arithmetic - Example YouTube 10:58
Extended Euclidean Algorithm and Inverse Modulo Tutorial by Emily Scott YouTube 5:59
Cryptography Video Time Slides Stein et alRosen
Practical Concerns of RSA (no Video, but the section i Stein et al is a useful read) N/A PDF p. 139-143 N/A

Hans Georg Schaathun / hasc@hials.no