网络安全与数据治理2024，Vol.43Issue(8)：28-34,7.DOI:10.19358/j.issn.2097-1788.2024.08.005
椭圆曲线标量乘高效方案设计
Energy-efficient scheme of elliptic curve cryptography scalar multiplication
吴昆 1胡现刚 2张学超 3汪晓睿1
作者信息
- 1. 91977 部队,北京 100071
- 2. 南部战区海军参谋部,广东 湛江 524000
- 3. 中央军委政法委,北京 100000
- 折叠
摘要
Abstract
Due to the limited resources of the wireless sensor network,the elliptic curve cryptographic algorithm requires a large amount of computation,which seriously affects the life cycle of the network.It is necessary to make lightweight improvements to the algorithm to reduce resource consumption.Scalar multiplication is the key to the execution efficiency of elliptic curve crypto-graphic algorithms.By analyzing the storage and processing characteristics of wireless sensor nodes,we improve the underlying domain operations firstly,and propose the 3-Karatsuba block-combined multiplication algorithm,fast modular reduction algo-rithm,modular square and modular inverse algorithm on binary domain,which can reduce the times of basic operations and mem-ory read and write.Finally,we design a fast implementation scheme of scalar multiplication on GF(2m)based on the Montgom-ery algorithm.The results of experiments on 8 bit AVR microprocessor demonstrate that,completing an ECC point multiplication operation on the GF(2163)domain requires a total of 5 160 991 clock cycles,with a time consumption of approximately0.70 sec-onds,our contribution can improve ECC scalar multiplication significantly.关键词
椭圆曲线密码/标量乘/二进制域运算/模运算Key words
elliptic curve cryptography(ECC)/scalar multiplication/binary field operations/modular operation分类
信息技术与安全科学引用本文复制引用
吴昆,胡现刚,张学超,汪晓睿..椭圆曲线标量乘高效方案设计[J].网络安全与数据治理,2024,43(8):28-34,7.
