Example: n= pq

• There is a unique x < pq such that

x = a mod p

x = b mod q

Can find it by first finding u such that uq=1 mod p

Then x = (((a-b)u)mod p)q + b

Easy corollary: x = a mod p, x = a mod q

=> x = a mod n.

Previous slide

Next slide

Back to first slide

View graphic version