A Prediction-Based Scalable Design for Montgomery Modular Multiplication

DOI

10.2991/eeic-13.2013.11How to use a DOI?

Keywords

Montgomery modular multiplication, word-based version of Montgomery algorithm, scalable architecture.

Abstract

Modular multiplication is a basic operation in public key cryptosystems, like RSA and elliptic curve cryptography (ECC). There are many algorithms to speed up its calculation. Among them, Montgomery algorithm is the most efficient method for avoiding expensive divisions. Recently, due to the increasing use of diverse embedded systems, variable precision modular multiplications with scalable architectures gain more and more attentions. In this paper, we propose a new word-based implementation of Montgomery modular multiplication. A predict policy is incorporated with a scalable architecture to reduce area cost and time latency. Compared with other scalable designs, our area-time product is the best among all, with little memory overhead.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - De-Sheng Chen
AU  - Huan-Teng Li
AU  - Yi-Wen Wang
PY  - 2013/12
DA  - 2013/12
TI  - A Prediction-Based Scalable Design for Montgomery Modular Multiplication
BT  - Proceedings of the 3rd International Conference on Electric and Electronics
PB  - Atlantis Press
SP  - 46
EP  - 50
SN  - 1951-6851
UR  - https://doi.org/10.2991/eeic-13.2013.11
DO  - 10.2991/eeic-13.2013.11
ID  - Chen2013/12
ER  -