1
00:00:00,000 --> 00:00:03,466
Just to go through, again, 
the topics of the week.

2
00:00:03,466 --> 00:00:06,033
these roughly correspond 
to 2 minutes each.

3
00:00:06,033 --> 00:00:10,133
So we talked about "the following are equivalent". 
We'll see what that is when we get to it.

4
00:00:10,133 --> 00:00:13,066
What I mean by this is we had a 
bunch of criteria for congruences

5
00:00:13,066 --> 00:00:15,766
and these list them all.

6
00:00:15,766 --> 00:00:19,566
We talked about inverses, 
multiplicative inverses in Z mod m.

7
00:00:19,566 --> 00:00:22,300
We talked about the Linear Congruence 
Theorem, the second part to it.

8
00:00:22,300 --> 00:00:26,400
So where we reword it using our new
notation with the equivalence classes.

9
00:00:26,400 --> 00:00:28,666
Then we talked about a couple 
of major theorems in this course:

10
00:00:28,666 --> 00:00:32,000
Fermat’s Little Theorem, Chinese Remainder 
Theorem and Splitting the Modulus.

11
00:00:32,000 --> 00:00:34,933
Then we wrapped up the week with 
a brief introduction to cryptography.

12
00:00:34,933 --> 00:00:38,900
Again remember our goal is to head 
to RSA, which we'll do next week.

13
00:00:38,900 --> 00:00:41,600
Actually I’m probably going to 
isolate that in its own video,

14
00:00:41,600 --> 00:00:42,800


15
00:00:42,800 --> 00:00:45,766
but here's the overview, and then I guess we 
finished off with the square and multiply algorithm.

16
00:00:45,766 --> 00:00:48,133
It gives you a quick 
way to compute

17
00:00:48,133 --> 00:00:50,400
large powers of numbers

18
00:00:50,400 --> 00:00:53,466
to not necessarily prime moduli.