Secure Binary Field Multiplication

Abstract

Binary field multiplication is the most fundamental building block of binary field Elliptic Curve Cryptography ECC and Galois/Counter Mode GCM. Both bit-wise scanning and Look-Up Table LUT based methods are commonly used for binary field multiplication. In terms of Side Channel Attack SCA, bit-wise scanning exploits insecure branch operations which leaks information in a form of timing and power consumption. On the other hands, LUT based method is regarded as a relatively secure approach because LUT access can be conducted in a regular and atomic form. This ensures a constant time solution as well. In this paper, we conduct the SCA on the LUT based binary field multiplication. The attack exploits the horizontal Correlation Power Analysis CPA on weights of LUT. We identify the operand with only a power trace of binary field multiplication. In order to prevent SCA, we also suggest a mask based binary field multiplication which ensures a regular and constant time solution without LUT and branch statements.