Research on fine-grained parallel computation for elliptic curve cryptography(椭圆曲线密码细粒度并行计算研究)

CHENHua-feng(陈华锋); ZHUANGJian-zhong(庄建忠); JIANGYan-bing(姜燕冰)

doi:10.3785/j.issn.1008-9497.2013.03.008

Zhejiang Daxue xuebao. Lixue ban (May 2013)

Research on fine-grained parallel computation for elliptic curve cryptography(椭圆曲线密码细粒度并行计算研究)

CHENHua-feng(陈华锋),
ZHUANGJian-zhong(庄建忠),
JIANGYan-bing(姜燕冰)

Affiliations

CHENHua-feng(陈华锋): School of Electronic Information, Zhejiang University of Media and Communications, Hangzhou 310018, China(浙江传媒学院电子信息学院，浙江　杭州　310018)
ZHUANGJian-zhong(庄建忠): School of Electronic Information, Zhejiang University of Media and Communications, Hangzhou 310018, China(浙江传媒学院电子信息学院，浙江　杭州　310018)
JIANGYan-bing(姜燕冰): School of Electronic Information, Zhejiang University of Media and Communications, Hangzhou 310018, China(浙江传媒学院电子信息学院，浙江　杭州　310018)

DOI: https://doi.org/10.3785/j.issn.1008-9497.2013.03.008
Journal volume & issue: Vol. 40, no. 3
pp. 276 – 279

Abstract

Read online

根据加速经常性设计的原则，提出了一种基于对称运算单元的椭圆曲线密码(ECC)标量乘运算的高效细粒度并行运算架构.为了实现该架构，对ECC标量乘运算展开细粒度并行计算研究，通过标量乘运算的分解和推导，消除了数据相关性，得出运算效率高且适于指令级并行计算的算法形式.对标量乘运算的时间复杂度的分析结果表明，该算法比普通算法的速度提升了66.7%.并可通过并行计算进一步提升标量乘运算的速度性能.在采用3个运算单元的效率最优情况下，比采用1个运算单元时，速度提高了2倍.

Published in Zhejiang Daxue xuebao. Lixue ban

ISSN: 1008-9497 (Print)
Publisher: Zhejiang University Press
Country of publisher: China
LCC subjects: Science: Mathematics: Instruments and machines: Electronic computers. Computer science; Science: Physics
Website: https://www.zjujournals.com/sci/EN/1008-9497/home.shtml

About the journal

Abstract

Keywords