January 15, 2002
Practical Aspects of Modern Cryptography
Proof of Fermat’s Little Theorem
•
By induction on
x
…
•
•
Basis
•
If
x
= 0
, then
x
p
mod
p
= 0 =
x
mod
p
.
•
If
x
= 1
, then
x
p
mod
p
= 1 =
x
mod
p
.
•
