 |
|
| Science Forum Index » Cryptography Forum » Sliding Window... |
|
Page 1 of 1 |
|
| Author |
Message |
| Martin... |
 Posted: Mon Oct 19, 2009 10:18 pm |
|
|
|
Guest
|
Hi,
I wonder what are the advantages of the sliding window approach to
implement modular exponentiation. Normally,
I would use the window method where I pre-calculate the powers for a
certain number of bits, e.g. if I have a window size of 4 then I
precalculate the power 2^0 to 2^15 and process then 4 bits of the
exponent at the same time. Maybe someone can exactly point me out how
this sliding window differs from the standard window method.
Many thanks
Martin |
|
|
| Back to top |
|
|
|
| Tom St Denis... |
| Posted: Tue Oct 20, 2009 12:06 am |
|
|
|
Guest
|
On Oct 20, 4:18 am, Martin <sportfre... at (no spam) gmx.at> wrote:
[quote]Hi,
I wonder what are the advantages of the sliding window approach to
implement modular exponentiation. Normally,
I would use the window method where I pre-calculate the powers for a
certain number of bits, e.g. if I have a window size of 4 then I
precalculate the power 2^0 to 2^15 and process then 4 bits of the
exponent at the same time. Maybe someone can exactly point me out how
this sliding window differs from the standard window method.
[/quote]
First benefit is you only have to precompute half the values. The
sliding window is such that you're guaranteed to have the msb of your
window set.
The second is you perform marginally fewer multiplications.
Tom |
|
|
| Back to top |
|
|
|
|
|
All times are GMT - 5 Hours
The time now is Fri Dec 11, 2009 5:33 am
|
|