Cryptography (?)

In today crypto lecture, the lecturer taught:
- Non Polynomial Bounded functions
- Fermet’s Little Theorem
- Euler’s Totient Function
- Corollary
- Chinese Remainder Theorem
- Hard Problems
- Notion of No-Harder-Than
- Primitive Roots of Integers
- Modular Arithmetic
- Extended Euclic Algorithm
- Discrete Logarithm
- Miller-Rabin Primality Test
- Pseudo-Primes
- Prime Distribution
- Affirmative Prive Tests
- One-Way Functions

From today crypto lecture, what stick in my brain are:
- “I hope this is not hard for you to see that…”
- “It is clear that…”
- “So, it turns out that…”
- “I believe it is very obvious to you that…”
- “I leave the proof to you”

I dont understand any of the theorems @.@

I wonder if I'm taking Math III or Cryptography?
Erlin.D