面向多椭圆曲线的高速标量乘法器设计与实现

于斌; 黄海; 刘志伟; 赵石磊; 那宁

doi:10.11959/j.issn.1000-436X.2020226

您当前的位置：

首页 >

文章列表页 >

面向多椭圆曲线的高速标量乘法器设计与实现

学术论文 | 更新时间：2024-06-05

- 面向多椭圆曲线的高速标量乘法器设计与实现
- Design and implementation of high-speed scalar multiplier for multi-elliptic curve
- 通信学报 2020年41卷第12期页码：100-109
- 作者机构：
  
  哈尔滨理工大学软件与微电子学院，黑龙江哈尔滨 150080
- 作者简介：
  
  [ "于斌（1984- ），男，黑龙江饶河人，哈尔滨理工大学讲师，主要研究方向为密码算法、密码芯片设计、数字集成电路设计等。" ]
  [ "黄海（1982- ），男，内蒙古巴彦淖尔人，博士，哈尔滨理工大学副教授、硕士生导师，主要研究方向为信息安全、可重构技术、集成电路设计等。" ]
  [ "刘志伟（1987- ），男，黑龙江哈尔滨人，哈尔滨理工大学讲师、博士生，主要研究方向为可重构计算、高速密码算法、并行加密技术、密码芯片的安全设计等。" ]
  [ "赵石磊（1979- ），男，黑龙江肇源人，博士，哈尔滨理工大学副教授、硕士生导师，主要研究方向为信息安全、高速密码算法、密码芯片的安全设计等。" ]
  [ "那宁（1995- ），男，黑龙江牡丹江人，哈尔滨理工大学硕士生，主要研究方向为信息安全、集成电路设计等。" ]
- 基金信息：
  
  黑龙江省自然科学基金资助项目(YQ2019F010);黑龙江省普通本科高等学校青年创新人才培养计划基金资助项目(UNPYSCT-2017081);国家重点研发计划基金资助项目(2018YFB2202100)
- DOI：10.11959/j.issn.1000-436X.2020226
  中图分类号： TN918；TP309
- 网络出版日期：2020-12，
  
  纸质出版日期：2020-12-25
- 稿件说明：
移动端阅览
于斌, 黄海, 刘志伟, 等. 面向多椭圆曲线的高速标量乘法器设计与实现[J]. 通信学报, 2020,41(12):100-109.

Bin YU, Hai HUANG, Zhiwei LIU, et al. Design and implementation of high-speed scalar multiplier for multi-elliptic curve[J]. Journal on communications, 2020, 41(12): 100-109.
于斌, 黄海, 刘志伟, 等. 面向多椭圆曲线的高速标量乘法器设计与实现[J]. 通信学报, 2020,41(12):100-109. DOI： 10.11959/j.issn.1000-436X.2020226.

Bin YU, Hai HUANG, Zhiwei LIU, et al. Design and implementation of high-speed scalar multiplier for multi-elliptic curve[J]. Journal on communications, 2020, 41(12): 100-109. DOI： 10.11959/j.issn.1000-436X.2020226.

摘要

针对现有标量乘法器不能适用于多椭圆曲线且运算开销较大的问题，设计了一种能应用于两类素数域椭圆曲线的高速标量乘法器。首先，在标量乘算法上，对secp256r1曲线的基点采用Comb算法，对普通点采用Shamir算法，对 Curve25519 曲线使用蒙哥马利阶梯算法；然后，优化了点加和倍点运算的操作步骤，并对点加中 Z=1的情况进行简化设计，有效减少计算周期数；最后，采用快速模约简实现模乘，设计了 Curve25519 的快速模约简算法。整个设计充分考虑复用，在55 nm CMOS工艺下需1 022×10

个等效门，在secp256r1和Curve25519上计算普通点标量乘，运算速度分别为15.3万次/秒和15.8万次/秒，其中secp256r1上的运算速度是现有设计的1.9倍。

Abstract

Aiming at the problem that the existing scalar multiplier cannot be applied to multi-elliptic curve and the cost is expensive

a high-speed scalar multiplier was designed

applicable to two types of elliptic curves over prime fields.Firstly

in terms of the scalar multiplication

secp256r1 base points were processed with the comb algorithm

and the Shamir algorithm for ordinary points

and the Montgomery ladder algorithm for Curve25519.Secondly

the operation of point addition and point doubling was optimized

and the condition of Z=1 in point addition was simplified

thereby effectively reducing the number of calculation cycles.Lastly

a fast modular reduction algorithm of Curve25519 was designed for modular multiplication.Multiplexing was an important factor in the entire designing process.A 1022K equivalent gate was selected for the 55 nm CMOS process.This allowed ordinary point scalar multiplications performed on secp256r1 and Curve25519 respectively

calculating at the speeds of 153 000 times per second and 158 000 times per second

with the speed for secp256r1 1.9 times that of the existing designed one.

关键词

Keywords

references

姜久兴 , 厚娇 , 黄海 , 等 . 低面积复杂度AES低熵掩码方案的研究 [J ] . 通信学报 , 2019 , 40 ( 5 ): 201 - 210 .

JIANG J X , HOU J , HUANG H , et al . Research on area-efficient low-entropy masking scheme for AES [J ] . Journal on Communications , 2019 , 40 ( 5 ): 201 - 210 .

RESCORLA E , MOZILLA . The transport layer security (TLS) protocol version 1.3:RFC8446 [S ] . IETF ,(2018-08) [ 2020 - 03 - 07 ] .

KUDITHI T , SAKTHIVEL R . High-performance ECC processor architecture design for IoT security applications [J ] . Journal of Supercomputing , 2019 , 75 ( 1 ): 447 - 474 .

HOSSAIN M S , KONG Y , SAEEDI E , et al . High-performance elliptic curve cryptography processor over NIST prime fields [J ] . IET Computers ＆ Digital Techniques , 2017 , 11 ( 1 ): 33 - 42 .

LIU J W , GUAN Z Y , CHENG D X , et al . A high speed VLSI implementation of 256-bit scalar point multiplier for ECC over GF (p) [C ] // 2018 IEEE International Conference on Intelligence and Safety for Robotics . Piscataway:IEEE Press , 2018 : 184 - 191 .

LEE J W , CHUNG S C , CHANG H C , et al . Efficient power-analysis-resistant dual-field elliptic curve cryptographic processor using heterogeneous dual-processing-element architecture [J ] . IEEE Transactions on Very Large Scale Integration Systems , 2014 , 22 ( 1 ): 49 - 61 .

CHUNG S C , LEE J W , CHANG H C , et al . A high-performance elliptic curve cryptographic processor over GF(p) with SPA resistance [C ] // IEEE International Symposium on Circuits and Systems . Piscataway:IEEE Press , 2012 : 1456 - 1459 .

AL-SOMANI T F . High-performance generic-point parallel scalar multiplication [J ] . Arabian Journal for Science and Engineering , 2017 , 42 ( 2 ): 507 - 512 .

JAVEED K , WANG X , SCOTT M . High performance hardware support for elliptic curve cryptography over general prime field [J ] . Microprocessors ＆ Microsystems , 2017 , 51 ( 6 ): 331 - 342 .

王敏 , 吴震 . 抗SPA 攻击的椭圆曲线NAF 标量乘实现算法 [J ] . 通信学报 , 2012 , 33 ( Z1 ): 228 - 232 .

WANG M , WU Z . Algorithm of NAF scalar multiplication on ECC against SPA [J ] . Journal on Communications , 2012 , 33 ( Z1 ): 228 - 232 .

MOHAMED N , HASHIM M , HUTTER M . Improved fixed-base comb method for fast scalar multiplication [C ] // Proceedings of the 5th International Conference on Cryptology . Berlin:Springer , 2012 : 342 - 359 .

ZHANG N , CHEN Z , XIAO G . Efficient elliptic curve scalar multiplication algorithms resistant to power analysis [J ] . Information Sciences , 2007 , 177 ( 10 ): 2119 - 2129 .

徐明 , 史量 . 基于伪四维投射坐标的多基链标量乘法 [J ] . 通信学报 , 2018 , 39 ( 5 ): 74 - 84 .

XU M , SHI L . Pseudo 4D projective coordinate-based multi-base scalar multiplication [J ] . Journal on Communications , 2018 , 39 ( 5 ): 74 - 84 .

IEEE Standards Association . IEEE standard specifications for public-key cryptography:IEEE Std 1363-2000 [S ] . IEEE ,(2000-07) [ 2020 - 05 - 06 ] .

LI W , ZENG X Y , FENG X . A high-throughput processor for dual-field elliptic curve cryptography with power analysis resistance [C ] // 2015 IEEE 15th International Conference on Scalable Computing and Communications and Its Associated Workshops . Piscataway:IEEE Press , 2015 : 570 - 577 .

COHEN H , MIYAJI A , ONO T . Efficient elliptic curve exponentiation using mixed coordinates [C ] // International Conference on the Theory＆ Applications of Cryptology ＆ Information Security:Advances in Cryptology . Berlin:Springer , 1998 : 51 - 65 .

王潮 , 时向勇 , 牛志华 . 基于蒙哥马利曲线改进 ECDSA 算法的研究 [J ] . 通信学报 , 2010 , 31 ( 1 ): 9 - 13 .

WANG C , SHI X Y , NIU Z H . The research of the promotion for ECDSA algorithm based on Montgomery-form ECC [J ] . Journal on Communications , 2010 , 31 ( 1 ): 9 - 13 .

MARZOUQI H , AL-QUTAYRI M , SALAH K , et al . A 65nm ASIC based 256 NIST prime field ECC processor [C ] // 2016 IEEE 59th International Midwest Symposium on Circuits and Systems (MWSCAS) . IEEE , 2016 .

MARZOUQI H , AL-QUTAYRI M , SALAH K . Review of elliptic curve cryptography processor designs [J ] . Microprocessors and Microsystems , 2015 , 39 ( 2 ): 97 - 112 .

HANKERSON D , MENEZES A , VANSTONE S . Guide to elliptic curve cryptography [M ] . Berlin : Springer , 2004 .

BERNSTEIN D , . CURVE25519:new Diffie-Hellman speed records [C ] // International Workshop on Public Key Cryptography , Berlin:Springer , 2006 : 207 - 228 .

LANGLEY A , GOOGLE , Hamburg M , et al . Elliptic curves for Security:RFC7748 [S ] . IETF ,(2016-01) [ 2020 - 01 - 21 ] .

SALARIFARD R BAYAT-SARMADI S . An efficient low-latency point-multiplication over Curve25519 [J ] . IEEE Transactions on Circuits and Systems-I:Regular Papers , 2019 , 66 ( 10 ): 3854 - 3862 .

DÜELL M , HAASE B , HINTERWAELDER G , et al . High-speed curve25519 on 8-bit,16-bit,and 32-bit microcontrollers [J ] . Designs Codes ＆ Cryptography , 2015 , 77 ( 2-3 ): 493 - 514 .

CHEN Y L , LEE J W , LIU P C , et al . A dual-field elliptic curve cryptographic processor with a radix-4 unified division unit [C ] // IEEE International Symposium of Circuits and Systems . Piscataway:IEEE , 2011 : 713 - 716 .

RASHIDI B . A survey on hardware implementations of elliptic curve cryptosystems [J ] . arXiv Preprint,arXiv:1710.08336 , 2017 .

浏览量

778

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于Zynq平台的BFV全同态加密算法高效实现

高速Ed25519验签算法硬件架构的设计与实现