January 8, 2002
Practical Aspects of Modern Cryptography
How to compute
Y
X
mod
N
•
We can now perform a 1,000-bit modular
exponentiation using ~1,500 1,000-bit
modular multiplications.
•
•
1,000 squarings:
y
,
y
2
,
y
4
, …,
y
2
1000
•
•
~500 “ordinary” multiplications