Pseudo τ - adic non adjacent form for scalar multiplication on Koblitz curves

In ECC, scalar multiplication is the dominant operation, namely computing nP from a point P on an elliptic curve where the multiplier n is an integer, defined as the point resulting from adding P + P + ∙∙∙ + P , n times. The τ-NAF proposed by Solinas, is one of the most efficient algorithms to compute scalar multiplications on Koblitz curves. In this paper, we introduced an equivalent multiplier to τ-NAF namely pseudoTNAF. It is based on the idea of transforming the τ-NAF expression to a reduced τ -NAF that has been done by some researchers. It can eliminate the elliptic doublings in scalar multiplication method, and double the number of elliptic additions. We provide the formula for obtaining a total of lattice points in Voronoi region of modulo r + sτ where r + sτ an element of ring Z (τ). This helps us to find all the multipliers n that based on τ-NAF. We also discuss the estimation of operational costs when using pseudoTNAF as a multiplier of scalar multiplication.

Text Cryptology2014-5.pdf Restricted to Repository staff only Download (675kB)

Actions (login required)

View Item