A high-speed design of montgomery multiplier

Yibo Fan, Takeshi Ikenaga, Satoshi Goto

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

With the increase of key length used in public cryptographic algorithms such as RSA and ECC, the speed of Montgomery multiplication becomes a bottleneck. This paper proposes a high speed design of Montgomery multiplier. Firstly, a modified scalable high-radix Montgomery algorithm is proposed to reduce critical path. Secondly, a high-radix clock-saving dataflow is proposed to support high-radix operation and one clock cycle delay in dataflow. Finally, a hardware-reused architecture is proposed to reduce the hardware cost and a parallel radix-16 design of data path is proposed to accelerate the speed. By using HHNEC 0.25 fim standard cell library, the implementation results show that the total cost of Montgomery multiplier is 130 KGates, the clock frequency is 180 MHz and the throughput of 1024-bit RSA encryption is 352 kbps. This design is suitable to be used in high speed RSA or ECC encryption/decryption. As a scalable design, it supports any key-length encryption/decryption up to the size of on-chip memory.

Original languageEnglish
Pages (from-to)971-977
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE91-A
Issue number4
DOIs
Publication statusPublished - 2008

Fingerprint

Multiplier
High Speed
Encryption
Cryptography
Clocks
Data Flow
Montgomery multiplication
Hardware
Critical Path
Hardware Architecture
Costs
Accelerate
Chip
Throughput
Cycle
Data storage equipment
Path
Design
Cell

Keywords

  • High-radix
  • High-speed
  • Montgomery multiplier
  • Scalable

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this

A high-speed design of montgomery multiplier. / Fan, Yibo; Ikenaga, Takeshi; Goto, Satoshi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E91-A, No. 4, 2008, p. 971-977.

Research output: Contribution to journalArticle

@article{5317f3803ef848e89ccd42330a81d676,
title = "A high-speed design of montgomery multiplier",
abstract = "With the increase of key length used in public cryptographic algorithms such as RSA and ECC, the speed of Montgomery multiplication becomes a bottleneck. This paper proposes a high speed design of Montgomery multiplier. Firstly, a modified scalable high-radix Montgomery algorithm is proposed to reduce critical path. Secondly, a high-radix clock-saving dataflow is proposed to support high-radix operation and one clock cycle delay in dataflow. Finally, a hardware-reused architecture is proposed to reduce the hardware cost and a parallel radix-16 design of data path is proposed to accelerate the speed. By using HHNEC 0.25 fim standard cell library, the implementation results show that the total cost of Montgomery multiplier is 130 KGates, the clock frequency is 180 MHz and the throughput of 1024-bit RSA encryption is 352 kbps. This design is suitable to be used in high speed RSA or ECC encryption/decryption. As a scalable design, it supports any key-length encryption/decryption up to the size of on-chip memory.",
keywords = "High-radix, High-speed, Montgomery multiplier, Scalable",
author = "Yibo Fan and Takeshi Ikenaga and Satoshi Goto",
year = "2008",
doi = "10.1093/ietfec/e9l-a.4.971",
language = "English",
volume = "E91-A",
pages = "971--977",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "4",

}

TY - JOUR

T1 - A high-speed design of montgomery multiplier

AU - Fan, Yibo

AU - Ikenaga, Takeshi

AU - Goto, Satoshi

PY - 2008

Y1 - 2008

N2 - With the increase of key length used in public cryptographic algorithms such as RSA and ECC, the speed of Montgomery multiplication becomes a bottleneck. This paper proposes a high speed design of Montgomery multiplier. Firstly, a modified scalable high-radix Montgomery algorithm is proposed to reduce critical path. Secondly, a high-radix clock-saving dataflow is proposed to support high-radix operation and one clock cycle delay in dataflow. Finally, a hardware-reused architecture is proposed to reduce the hardware cost and a parallel radix-16 design of data path is proposed to accelerate the speed. By using HHNEC 0.25 fim standard cell library, the implementation results show that the total cost of Montgomery multiplier is 130 KGates, the clock frequency is 180 MHz and the throughput of 1024-bit RSA encryption is 352 kbps. This design is suitable to be used in high speed RSA or ECC encryption/decryption. As a scalable design, it supports any key-length encryption/decryption up to the size of on-chip memory.

AB - With the increase of key length used in public cryptographic algorithms such as RSA and ECC, the speed of Montgomery multiplication becomes a bottleneck. This paper proposes a high speed design of Montgomery multiplier. Firstly, a modified scalable high-radix Montgomery algorithm is proposed to reduce critical path. Secondly, a high-radix clock-saving dataflow is proposed to support high-radix operation and one clock cycle delay in dataflow. Finally, a hardware-reused architecture is proposed to reduce the hardware cost and a parallel radix-16 design of data path is proposed to accelerate the speed. By using HHNEC 0.25 fim standard cell library, the implementation results show that the total cost of Montgomery multiplier is 130 KGates, the clock frequency is 180 MHz and the throughput of 1024-bit RSA encryption is 352 kbps. This design is suitable to be used in high speed RSA or ECC encryption/decryption. As a scalable design, it supports any key-length encryption/decryption up to the size of on-chip memory.

KW - High-radix

KW - High-speed

KW - Montgomery multiplier

KW - Scalable

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

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

U2 - 10.1093/ietfec/e9l-a.4.971

DO - 10.1093/ietfec/e9l-a.4.971

M3 - Article

AN - SCOPUS:77951489522

VL - E91-A

SP - 971

EP - 977

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 4

ER -