January 8, 2002
Practical Aspects of Modern Cryptography
How to compute
Y
X
mod N
•
Compute
Y
X
and then reduce
mod
N
.
•
•
If
X
,
Y
,
and
N
each are 1,000-bit integers,
Y
X
consists of ~2
1010
bits.
•
•
Since there are roughly 2
250
particles in the
universe, storage is a problem.
