January 8, 2002
Practical Aspects of Modern Cryptography
How to compute
Y
X
mod N
•
Repeatedly multiplying by
Y
(followed
each time by a reduction modulo
N
)
X
times solves the storage problem.
•
•
However, we would need to perform ~2
900
32-bit multiplications per second to
complete the computation before the sun
burns out.
