Secure binary field multiplication

Hwajeong Seo, Chien Ning Chen, Zhe Liu, Yasuyuki Nogami, Taehwan Park, Jongseok Choi, Howon Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages161-173
Number of pages13
Volume9503
ISBN (Print)9783319318745
DOIs
Publication statusPublished - 2016
Event16th International Workshop on Information Security Applications, WISA 2015 - Jeju Island, Korea, Republic of
Duration: Aug 20 2015Aug 22 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9503
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other16th International Workshop on Information Security Applications, WISA 2015
CountryKorea, Republic of
CityJeju Island
Period8/20/158/22/15

Fingerprint

Look-up Table
Multiplication
Binary
Side Channel Attacks
Scanning
Time Constant
Cryptography
Masks
Branch
Electric power utilization
Power Analysis
Correlation Analysis
Galois
Elliptic Curves
Building Blocks
Power Consumption
Mask
Side channel attack
Timing
Horizontal

Keywords

  • Binary field multiplication
  • Embedded processors
  • Horizontal correlation power analysis
  • Side channel attack

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Seo, H., Chen, C. N., Liu, Z., Nogami, Y., Park, T., Choi, J., & Kim, H. (2016). Secure binary field multiplication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9503, pp. 161-173). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9503). Springer Verlag. https://doi.org/10.1007/978-3-319-31875-2_14

Secure binary field multiplication. / Seo, Hwajeong; Chen, Chien Ning; Liu, Zhe; Nogami, Yasuyuki; Park, Taehwan; Choi, Jongseok; Kim, Howon.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9503 Springer Verlag, 2016. p. 161-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9503).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Seo, H, Chen, CN, Liu, Z, Nogami, Y, Park, T, Choi, J & Kim, H 2016, Secure binary field multiplication. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 9503, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9503, Springer Verlag, pp. 161-173, 16th International Workshop on Information Security Applications, WISA 2015, Jeju Island, Korea, Republic of, 8/20/15. https://doi.org/10.1007/978-3-319-31875-2_14
Seo H, Chen CN, Liu Z, Nogami Y, Park T, Choi J et al. Secure binary field multiplication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9503. Springer Verlag. 2016. p. 161-173. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-31875-2_14
Seo, Hwajeong ; Chen, Chien Ning ; Liu, Zhe ; Nogami, Yasuyuki ; Park, Taehwan ; Choi, Jongseok ; Kim, Howon. / Secure binary field multiplication. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9503 Springer Verlag, 2016. pp. 161-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8a0cbc3691c949c5912545f7a5c13cd5,
title = "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.",
keywords = "Binary field multiplication, Embedded processors, Horizontal correlation power analysis, Side channel attack",
author = "Hwajeong Seo and Chen, {Chien Ning} and Zhe Liu and Yasuyuki Nogami and Taehwan Park and Jongseok Choi and Howon Kim",
year = "2016",
doi = "10.1007/978-3-319-31875-2_14",
language = "English",
isbn = "9783319318745",
volume = "9503",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "161--173",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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

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

VL - 9503

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 161

EP - 173

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -