January 8, 2002
Practical Aspects of Modern Cryptography
Modular Reduction
•
Generally, computing
(A
•B) mod
N
requires
much more than twice the time to compute
A
•B
.
•
•
Division is slow and cumbersome.
