Efficient Algorithm on Koblitz Curves with Resistance to Side Channel Attacks
|Course||System Analysis and Integration|
|Keywords||Elliptic Curve Cryptography Koblitz curve Side channel attacks Smart Card|
Koblitz curves belong to a special binary elliptic curves . On which the scalar multiplication using the window width ω, the non-contiguous form said (TNAF_w) method can be calculated quickly . However, using TNAF_w scalar multiplication algorithm is vulnerable to side channel attacks . Side channel attacks is an easy to implement but powerful attack , the scope of the attack including agreement , modules , equipment and even the entire system . These attacks are a serious threat to the security of the cryptographic module . Therefore , the password system must assess its performance to resist such attacks and to consider the integration of various counter measures . Indeed , side channel attacks realization algorithm for public-key cryptosystem proposed new security challenges . Thus , in recent years , the public key cryptosystem to achieve the effectiveness of the algorithm ( high computational efficiency , small storage space ) and security against side channel attacks aim to design a new algorithm has become a hot research topic in the field of cryptography . This research work around the raised against side channel attacks , more efficient security algorithm to expand . First, the paper investigates the methods and techniques used in the side channel attacks , as well as its destructive , feasibility , applicability and resist its measures . Then , we propose efficient algorithm for a new resist side channel attacks . The basic idea of the algorithm is added by using TNAF_w method scalar multiplication in the redundant operation and combining randomized linear conversion coordinates (RLC) method used thereby can withstand use TNAF_w the scalar multiplication algorithm of the side letter Road attack of Refined Power Attack (RPA) and the Zero Value Attack ( ZVA ) . The algorithm to further optimize the precomputed number of points and computing time , compared with the SPA-resistant TNAF_w (STNAF_w) algorithm , the operator point number is expected to reduce by about 50% , a decrease of about 18% to 28% in the computation time .