Research and Design of a High-Performance Scalable Public-Key Cipher Coprocessor

LI Ming; WU Dan; DAI Kui; ZOU Xue-cheng

您当前的位置：

首页 >

文章列表页 >

Research and Design of a High-Performance Scalable Public-Key Cipher Coprocessor

更新时间：2025-07-16

- Research and Design of a High-Performance Scalable Public-Key Cipher Coprocessor
- Acta Electronica Sinica Vol. 39, Issue 3, Pages: 665-670(2011)
- 作者机构：
  
  华中科技大学电子科学与技术系,湖北,武汉,430074
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP309.7TN47
- Published：2011
- 稿件说明：
移动端阅览
LI Ming, WU Dan, DAI Kui, et al. Research and Design of a High-Performance Scalable Public-Key Cipher Coprocessor[J]. Acta Electronica Sinica, 2011, 39(3): 665-670.
DOI：

LI Ming, WU Dan, DAI Kui, et al. Research and Design of a High-Performance Scalable Public-Key Cipher Coprocessor[J]. Acta Electronica Sinica, 2011, 39(3): 665-670. DOI：

摘要

本文提出了一种高效的点乘调度策略和改进的双域高基Montgomery模乘算法

在此基础上设计了一种新型高性能可扩展公钥密码协处理器体系结构

并采用0.18μm 1P6M标准CMOS工艺实现了该协处理器

以支持RSA和ECC等公钥密码算法的计算加速.该协处理器通过扩展片上高速存储器和使用以基数为处理字长的方法

具有良好的可扩展性和较强的灵活性

支持2048位以内任意大数模幂运算以及576位以内双域任意椭圆曲线标量乘法运算.芯片测试结果表明其具有很好的加速性能

完成一次1024位模幂运算仅需197μs、

GF(p)

域192位标量乘法运算仅需225μs、

GF(2

)

域163位标量乘法运算仅需200.7μs.

Abstract

In this paper

an effective strategy of point multiplication scheduling and an improved algorithm of dual-field high radix Montgomery modular multiplication are proposed. Based on them

a new high-performance scalable public-key cipher coprocessor architecture for RSA and ECC computing acceleration is designed

which is implemented using the 0.18 μm 1P6M standard CMOS technology.The coprocessor has strong scalability and flexibility

which can support the modular exponentiation up to 2048 bit and the dual-field elliptic curve scalar multiplication up to 576 bit by enlarging the high-speed memory on chip and using the radix-length as processing base.The measured result shows that the coprocessor chip has high performance for accelerating the computation of RSA and ECC and can perform one 1024-bit modular exponentiation only in 197 μs

one the prime field 192-bit scalar multiplication only in 225 μs and the binary field 163-bit scalar multiplication only in 200.7 μs.

关键词

Keywords

references

Views

1580

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Research on Scalability of Blockchain Based on Sharding: A Survey

Scalable Network Verification Technologies: State of the Art and Future

A New Scheduling Algorithm with O Control Messages Complexity for High-Speed Crossbars

A Run Time Reconfigurable Coprocessor Research in Data Processing System of Space Solar Telescope

Related Author

LIU Ting-ting

XU Jia

YE Fei

MA Peng-cheng

YANG Jing-lin

JIANG Ling-yun

XU Ke

HUANG Han-lin

Related Institution

School of Computer Science, Nanjing University of Posts and Telecommunications

Department of Computer Science and Technology， Tsinghua University

Beijing National Research Center for Information Science and Technology

Zhongguancun Laboratory

Institute for Network Science and Cyberspace， Tsinghua University

⁰