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
N1 - Funding Information:
This work was supported by the Industrial Strategic Technology Development Program (This work was supported by the ICT R&D program of MSIP/IITP. [10043907, Development of high performance IoT device and Open Platform with Intelligent Software]).
Publisher Copyright:
© Springer International Publishing Switzerland 2015.
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
AN - SCOPUS:84922176389
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
A2 - Rhee, Kyung-Hyune
A2 - Yi, Jeong Hyun
PB - Springer Verlag
T2 - 15th International Workshop on Information Security Applications, WISA 2014
Y2 - 25 August 2014 through 27 August 2014
ER -