方面隧道攻击(SCA ) 可以利用漏信息到 breakcryptosystems。在这篇论文我们在场一个新 SCA 抵抗椭圆形的曲线数量增加算法。建议算法,造代表分级的 k 的小点绳的一个序列,由所有小点绳与零不同的事实描绘了;这个性质将为算法保证一致计算行为,并且将因此对简单力量使它安全“分析攻击(矿泉) 。与另外的随机化技术,建议反措施不惩罚计算时间。建议计划比 MOller 更有效“ s,它在附近是的费用 5% ~ 10% 比 MOller 小” s。
Side-channel attacks (SCA) may exploit leakage information to break cryptosystems. In this paper we present a new SCA resistant Elliptic Curve scalar multiplication algorithm. The proposed algorithm, builds a sequence of bit-strings representing the scalar k, characterized by the fact that all bit-strings are different from zero; this property will ensure a uniform computation behavior for the algorithm, and thus will make it secure against simple power analysis attacks (SPA). With other randomization techniques, the proposed countermeasures do not penalize the computation time. The proposed scheme is more efficient than MOEller's one, its cost being about 5% to 10% smaller than MOEller's one.