Institute of Electrical and Electronics Engineers, IEEE Transactions on Computers, 4(61), p. 591-592, 2012
DOI: 10.1109/tc.2011.109
Full text: Unavailable
In 2008, Dimitrov et al. proposed a point multiplication algorithm on Koblitz curves using multiple-base expansions. They claimed that their algorithm is the first provably sublinear point multiplication algorithm on Koblitz curves. In this paper, we show that the well-known τ-adic NAF method is already sublinear and also guarantees a better average performance.