An Introduction to Cryptography

January 8, 2002

Practical Aspects of Modern Cryptography

Checking Primality

Basic result from group theory –

If p is a prime, then for integers a such that 0 < a < p, then a p - 1 mod p = 1.

This is almost never true when p is composite.