We present the 2k-ary and the sliding window algorithms for fast exponentiation. We give a precise formula for the error terms of their complexity and we discuss how to choose the parameters or the exponent optimally.
On the complexity of the 2k-ary and of the sliding window algorithms for fast exponentiation / O.G. Rizzo. - In: RIVISTA DI MATEMATICA DELLA UNIVERSITÀ DI PARMA. - ISSN 0035-6298. - 7:3(2004), pp. 289-299.
On the complexity of the 2k-ary and of the sliding window algorithms for fast exponentiation
O.G. RizzoPrimo
2004
Abstract
We present the 2k-ary and the sliding window algorithms for fast exponentiation. We give a precise formula for the error terms of their complexity and we discuss how to choose the parameters or the exponent optimally.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
19.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
101.69 kB
Formato
Adobe PDF
|
101.69 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
