TY - GEN
T1 - Secure binary field multiplication
AU - Seo, Hwajeong
AU - Chen, Chien Ning
AU - Liu, Zhe
AU - Nogami, Yasuyuki
AU - Park, Taehwan
AU - Choi, Jongseok
AU - Kim, Howon
N1 - Funding Information:
This work was partly supported by Institute for Information and communications Technology Promotion(IITP) grant funded by the Korea government (MSIP) (No.10043907, Development of high performance IoT device and Open Platform with Intelligent Software) and the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC(Information Technology Research Center) support program (IITP-2015-H8501-15-1017) supervised by the IITP(Institute for Information and communications Technology Promotion)
Publisher Copyright:
© Springer International Publishing Switzerland 2016.
PY - 2016
Y1 - 2016
N2 - 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.
AB - 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.
KW - Binary field multiplication
KW - Embedded processors
KW - Horizontal correlation power analysis
KW - Side channel attack
UR - http://www.scopus.com/inward/record.url?scp=84962231350&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84962231350&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-31875-2_14
DO - 10.1007/978-3-319-31875-2_14
M3 - Conference contribution
AN - SCOPUS:84962231350
SN - 9783319318745
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 161
EP - 173
BT - Information Security Applications - 16th International Workshop, WISA 2015, Revised Selected Papers
A2 - Choi, Dooho
A2 - Kim, Ho-Won
PB - Springer Verlag
T2 - 16th International Workshop on Information Security Applications, WISA 2015
Y2 - 20 August 2015 through 22 August 2015
ER -