Montgomery multiplication and squaring for Optimal Prime Fields

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

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Optimal Prime Fields (OPFs) are considered to be one of the best choices for lightweight elliptic curve cryptography implementations on resource-constraint embedded processors. In this paper, we revisit the efficient modular arithmetic over the special prime fields, and present improved implementations of modular multiplication and squaring for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) and Coarsely Integrated Sliding Block Doubling (OPF-CISBD) methods. The OPF-CIOC and OPF-CISBD methods follow the general ideas of (consecutive) operand caching and sliding block doubling techniques, respectively. The methods have been carefully optimized and redesigned for Montgomery multiplication and squaring in an integrated fashion. We then evaluate the practical performance of proposed methods on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC and OPF-CISBD methods outperform the previous best known results in ACNS'14 by a factor of 8% and 32%. Furthermore, our methods are implemented in a regular way which helps to reduce the leakage of side-channel information.

Original languageEnglish
JournalComputers and Security
DOIs
Publication statusAccepted/In press - Nov 30 2014

Fingerprint

Cryptography
resources
performance

Keywords

  • Consecutive operand caching
  • Embedded processors
  • Montgomery multiplication
  • Operand caching
  • Optimal Prime Fields
  • Public key cryptography
  • Sliding block doubling

ASJC Scopus subject areas

  • Computer Science(all)
  • Law

Cite this

Montgomery multiplication and squaring for Optimal Prime Fields. / Seo, Hwajeong; Liu, Zhe; Nogami, Yasuyuki; Choi, Jongseok; Kim, Howon.

In: Computers and Security, 30.11.2014.

Research output: Contribution to journalArticle

Seo, Hwajeong ; Liu, Zhe ; Nogami, Yasuyuki ; Choi, Jongseok ; Kim, Howon. / Montgomery multiplication and squaring for Optimal Prime Fields. In: Computers and Security. 2014.
@article{76611982561a4a34a10aed6ac3157bbb,
title = "Montgomery multiplication and squaring for Optimal Prime Fields",
abstract = "Optimal Prime Fields (OPFs) are considered to be one of the best choices for lightweight elliptic curve cryptography implementations on resource-constraint embedded processors. In this paper, we revisit the efficient modular arithmetic over the special prime fields, and present improved implementations of modular multiplication and squaring for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) and Coarsely Integrated Sliding Block Doubling (OPF-CISBD) methods. The OPF-CIOC and OPF-CISBD methods follow the general ideas of (consecutive) operand caching and sliding block doubling techniques, respectively. The methods have been carefully optimized and redesigned for Montgomery multiplication and squaring in an integrated fashion. We then evaluate the practical performance of proposed methods on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC and OPF-CISBD methods outperform the previous best known results in ACNS'14 by a factor of 8{\%} and 32{\%}. Furthermore, our methods are 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, Sliding block doubling",
author = "Hwajeong Seo and Zhe Liu and Yasuyuki Nogami and Jongseok Choi and Howon Kim",
year = "2014",
month = "11",
day = "30",
doi = "10.1016/j.cose.2015.03.005",
language = "English",
journal = "Computers and Security",
issn = "0167-4048",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Montgomery multiplication and squaring for Optimal Prime Fields

AU - Seo, Hwajeong

AU - Liu, Zhe

AU - Nogami, Yasuyuki

AU - Choi, Jongseok

AU - Kim, Howon

PY - 2014/11/30

Y1 - 2014/11/30

N2 - Optimal Prime Fields (OPFs) are considered to be one of the best choices for lightweight elliptic curve cryptography implementations on resource-constraint embedded processors. In this paper, we revisit the efficient modular arithmetic over the special prime fields, and present improved implementations of modular multiplication and squaring for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) and Coarsely Integrated Sliding Block Doubling (OPF-CISBD) methods. The OPF-CIOC and OPF-CISBD methods follow the general ideas of (consecutive) operand caching and sliding block doubling techniques, respectively. The methods have been carefully optimized and redesigned for Montgomery multiplication and squaring in an integrated fashion. We then evaluate the practical performance of proposed methods on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC and OPF-CISBD methods outperform the previous best known results in ACNS'14 by a factor of 8% and 32%. Furthermore, our methods are 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 implementations on resource-constraint embedded processors. In this paper, we revisit the efficient modular arithmetic over the special prime fields, and present improved implementations of modular multiplication and squaring for OPFs, called Optimal Prime Field Coarsely Integrated Operand Caching (OPF-CIOC) and Coarsely Integrated Sliding Block Doubling (OPF-CISBD) methods. The OPF-CIOC and OPF-CISBD methods follow the general ideas of (consecutive) operand caching and sliding block doubling techniques, respectively. The methods have been carefully optimized and redesigned for Montgomery multiplication and squaring in an integrated fashion. We then evaluate the practical performance of proposed methods on representative 8-bit AVR processor. Experimental results show that the proposed OPF-CIOC and OPF-CISBD methods outperform the previous best known results in ACNS'14 by a factor of 8% and 32%. Furthermore, our methods are 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

KW - Sliding block doubling

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

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

U2 - 10.1016/j.cose.2015.03.005

DO - 10.1016/j.cose.2015.03.005

M3 - Article

AN - SCOPUS:84926481872

JO - Computers and Security

JF - Computers and Security

SN - 0167-4048

ER -