The canonical re-coding and sliding window techniques are often used in computation of scalar multiplication
k·P
on elliptic curves for reducing the average number of required operation.In this paper
scalar multiplication with canonical re-coding and sliding window techniques is analyzed by modeling the window partition process of canonical re-coding expression of
k
as Markov-chain
the average performance of scalar multiplication under different parameters are given and the optimal window sizes are computed.Finally
the comparison shows that scalar multiplication with canonical re-coding and sliding window techniques requires 10.32~17.32% fewer operations than m-ary method
and 4.53~8.40% fewer operations than simple sliding window method.