Improved modular multiplication for optimal prime fields

Hwajeong Seo, Zhe Liu, Yasuyuki Nogami, Jongseok Choi, Howon Kim

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

1 Citation (Scopus)

Abstract

Optimal Prime Fields (OPFs) are considered to be one of the best choices for lightweight elliptic curve cryptography implementation on resource-constraint embedded processors. In this paper, we revisit efficient implementation of the modular arithmetic over the special prime fields, and present improved implementation of modular multiplication for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) method. OPF-CIOC method follows the general idea of (consecutive) operand caching technique, but has been carefully optimized and redesigned for Montgomery multiplication in an integrated fashion. We then evaluate the practical performance of proposed method on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC method outperforms the previous best known results in ACNS’14 by a factor of 5%. Furthermore, our method is implemented in a regular way which helps to reduce the leakage of side-channel information.

Original languageEnglish
Title of host publicationInformation Security Applications - 15th International Workshop, WISA 2014, Revised Selected Papers
PublisherSpringer Verlag
Pages150-161
Number of pages12
Volume8909
ISBN (Electronic)9783319150864
DOIs
Publication statusPublished - 2015
Event15th International Workshop on Information Security Applications, WISA 2014 - , Korea, Republic of
Duration: Aug 25 2014Aug 27 2014

Publication series

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

Other

Other15th International Workshop on Information Security Applications, WISA 2014
CountryKorea, Republic of
Period8/25/148/27/14

Fingerprint

Modular multiplication
Cryptography
Caching
Montgomery multiplication
Modular arithmetic
Embedded Processor
Resource Constraints
Efficient Implementation
Leakage
Elliptic Curves
Consecutive
Evaluate
Experimental Results

Keywords

  • Consecutive operand caching
  • Embedded processors
  • Montgomery multiplication
  • Operand caching
  • Optimal prime fields
  • Public key cryptography

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Seo, H., Liu, Z., Nogami, Y., Choi, J., & Kim, H. (2015). Improved modular multiplication for optimal prime fields. In Information Security Applications - 15th International Workshop, WISA 2014, Revised Selected Papers (Vol. 8909, pp. 150-161). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8909). Springer Verlag. https://doi.org/10.1007/978-3-319-15087-1_12

Improved modular multiplication for optimal prime fields. / Seo, Hwajeong; Liu, Zhe; Nogami, Yasuyuki; Choi, Jongseok; Kim, Howon.

Information Security Applications - 15th International Workshop, WISA 2014, Revised Selected Papers. Vol. 8909 Springer Verlag, 2015. p. 150-161 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8909).

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

Seo, H, Liu, Z, Nogami, Y, Choi, J & Kim, H 2015, Improved modular multiplication for optimal prime fields. in Information Security Applications - 15th International Workshop, WISA 2014, Revised Selected Papers. vol. 8909, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8909, Springer Verlag, pp. 150-161, 15th International Workshop on Information Security Applications, WISA 2014, Korea, Republic of, 8/25/14. https://doi.org/10.1007/978-3-319-15087-1_12
Seo H, Liu Z, Nogami Y, Choi J, Kim H. Improved modular multiplication for optimal prime fields. In Information Security Applications - 15th International Workshop, WISA 2014, Revised Selected Papers. Vol. 8909. Springer Verlag. 2015. p. 150-161. (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-15087-1_12
Seo, Hwajeong ; Liu, Zhe ; Nogami, Yasuyuki ; Choi, Jongseok ; Kim, Howon. / Improved modular multiplication for optimal prime fields. Information Security Applications - 15th International Workshop, WISA 2014, Revised Selected Papers. Vol. 8909 Springer Verlag, 2015. pp. 150-161 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{42c0b087c6494f9782d0fb343621e4d3,
title = "Improved modular multiplication for optimal prime fields",
abstract = "Optimal Prime Fields (OPFs) are considered to be one of the best choices for lightweight elliptic curve cryptography implementation on resource-constraint embedded processors. In this paper, we revisit efficient implementation of the modular arithmetic over the special prime fields, and present improved implementation of modular multiplication for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) method. OPF-CIOC method follows the general idea of (consecutive) operand caching technique, but has been carefully optimized and redesigned for Montgomery multiplication in an integrated fashion. We then evaluate the practical performance of proposed method on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC method outperforms the previous best known results in ACNS’14 by a factor of 5{\%}. Furthermore, our method is implemented in a regular way which helps to reduce the leakage of side-channel information.",
keywords = "Consecutive operand caching, Embedded processors, Montgomery multiplication, Operand caching, Optimal prime fields, Public key cryptography",
author = "Hwajeong Seo and Zhe Liu and Yasuyuki Nogami and Jongseok Choi and Howon Kim",
year = "2015",
doi = "10.1007/978-3-319-15087-1_12",
language = "English",
volume = "8909",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "150--161",
booktitle = "Information Security Applications - 15th International Workshop, WISA 2014, Revised Selected Papers",

}

TY - GEN

T1 - Improved modular multiplication for optimal prime fields

AU - Seo, Hwajeong

AU - Liu, Zhe

AU - Nogami, Yasuyuki

AU - Choi, Jongseok

AU - Kim, Howon

PY - 2015

Y1 - 2015

N2 - Optimal Prime Fields (OPFs) are considered to be one of the best choices for lightweight elliptic curve cryptography implementation on resource-constraint embedded processors. In this paper, we revisit efficient implementation of the modular arithmetic over the special prime fields, and present improved implementation of modular multiplication for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) method. OPF-CIOC method follows the general idea of (consecutive) operand caching technique, but has been carefully optimized and redesigned for Montgomery multiplication in an integrated fashion. We then evaluate the practical performance of proposed method on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC method outperforms the previous best known results in ACNS’14 by a factor of 5%. Furthermore, our method is implemented in a regular way which helps to reduce the leakage of side-channel information.

AB - Optimal Prime Fields (OPFs) are considered to be one of the best choices for lightweight elliptic curve cryptography implementation on resource-constraint embedded processors. In this paper, we revisit efficient implementation of the modular arithmetic over the special prime fields, and present improved implementation of modular multiplication for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) method. OPF-CIOC method follows the general idea of (consecutive) operand caching technique, but has been carefully optimized and redesigned for Montgomery multiplication in an integrated fashion. We then evaluate the practical performance of proposed method on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC method outperforms the previous best known results in ACNS’14 by a factor of 5%. Furthermore, our method is implemented in a regular way which helps to reduce the leakage of side-channel information.

KW - Consecutive operand caching

KW - Embedded processors

KW - Montgomery multiplication

KW - Operand caching

KW - Optimal prime fields

KW - Public key cryptography

UR - http://www.scopus.com/inward/record.url?scp=84922176389&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84922176389&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-15087-1_12

DO - 10.1007/978-3-319-15087-1_12

M3 - Conference contribution

VL - 8909

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

SP - 150

EP - 161

BT - Information Security Applications - 15th International Workshop, WISA 2014, Revised Selected Papers

PB - Springer Verlag

ER -