SPA Resistant Scalar Multiplication Based on Addition and Tripling Indistinguishable on Elliptic Curve Cryptosystem

摘要

This paper analyzes the Symbolic Ternary Form (STF) scalar multiplication algorithm and binary scalar multiplication algorithm computation, compared with binary scalar multiplication algorithm, the efficiency of STF scalar multiplication algorithm is increased by 4.6% in an average, there is a corresponding advantage. For this reason, we improve the structure of STF scalar multiplication algorithm, and make the algorithm perform more "smooth" by constructing points plus (A) and the triple point (T) operation indistinguishable and thus resist the simple power analysis attacks, and propose Highest-weight Symbolic Ternary Form (HSTF), which make a scalar k transform into the highest-weight form, so that every cycle has a fixed pattern to resist SPA attack. With respect to anti-SPA binary scalar multiplication algorithm, the average efficiency enhances 17.7%.