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)


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
EditorsKyung-Hyune Rhee, Jeong Hyun Yi
PublisherSpringer Verlag
Number of pages12
ISBN (Electronic)9783319150864
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)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other15th International Workshop on Information Security Applications, WISA 2014
Country/TerritoryKorea, Republic of


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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Improved modular multiplication for optimal prime fields'. Together they form a unique fingerprint.

Cite this