January 15, 2002
Practical Aspects of Modern Cryptography
Fermat’s Little Theorem
•
If
p
is prime,
•
then
x
p
-1
mod
p
= 1
for all
0 <
x
<
p
.
•
•
Equivalently …
•
•
If
p
is prime,
•
then
x
p
mod
p
=
x
mod
p
for all integers
x
.
