Riv.Mat.Univ.Parma (7) 3* (2004)

OTTAVIO G. RIZZO

On the complexityof the 2k-ary and of the sliding window algorithms for fast exponentiation


Pages: 289-299
Received: 1 March 2004    Revised: 21 January 2005
Mathematics Subject Classification (2000):
11Y16


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 thedo parameters or the exponent optimally.


Home Riv.Mat.Univ.Parma