Optimization of Elliptic Curve Cryptography Resisting Power Attack Scalar Multiplication Algorithm in Security System on Chip
Xiang Wang, Liping Wang, Yuanchen Bai, Zhenxue He, Tao Wang, Bin Xu, He Zhang, Xiaocui Wang, Cheng Zhou, Weike Wang, Pei Du · 2015
This paper investigates the scalar multiplication algorithms of Elliptic Curve Cryptography (ECC) resisting power analysis attack in security System on Chip (SoC) and analyzes their efficiency. According to the characteristics of resource-constrained SoC, we compare and evaluate the average computation time complexity of different algorithms, and then propose an improved left to right Non-Adjacent Form (NAF) encoding algorithm (INAFEA). Furthermore, an improved scalar multiplication algorithm (ISMA) based on the INAFEA with the random signed binary code to call points operations is proposed, which can save a lot of chip area. Based on the work we have done, we proposed a new algorithm to preprocess the random key to make INAFEA more useful and built up an experimental encrypt system. The experimental results show that our proposed ISMA made the security SoC random power consumption, better efficiency and stronger ability to resist power analysis attack compared to the traditional scalar multiplication algorithm.