Number-theoretic theorems (Fermat's little theorem, Euler's theorem), prime numbers and factorisation

This week’s topics

Number-theoretic theorems (Fermat's little theorem, Euler's theorem), prime numbers and factorisation

1. Number-theoretic theorems (Fermat's little theorem, Euler's theorem), prime numbers and factorisation
2. Applications in cryptography and hashing

What you will be able to do

• 3.2 Explain a range of key number theoretic theorems and proofs.
• 3.4 Evaluate the use of modular arithmetic and prime numbers in security applications such as cryptography and hashing.

Activity

Seminar, guided reading and a short written task: explain a range of key number theoretic theorems and proofs.

Study materials