首页|一种高效轻量的双参数椭圆曲线数字签名批量验证方案

一种高效轻量的双参数椭圆曲线数字签名批量验证方案

扫码查看
为解决大规模交易任务的签名验证给区块链节点带来繁琐的开销和经典的椭圆曲线数字签名算法(ECDSA)中耗时的模逆运算,提出一种高效轻量的双参数椭圆曲线数字签名(TP-ECDSA)批量验证方案.一方面,TP-ECDSA在签名和验证阶段均无模逆运算,在该算法中引入批量验证能将标量乘的计算次数从2t减少到[2,t+1].另一方面,KGLP算法能加速标量乘运算,引入该算法能显著地提升签名验证的效率.实验表明,与ECDSA相比,不论是独立验证还是批量验证,TP-ECDSA的运行速度均提高了 50%以上,签名验证效率显著提升.
An Efficient and Lightweight Two-Parameter ECDSA Batch Verification Scheme
To solve the cumbersome overhead of signature verification for large-scale transaction tasks to blockchain nodes and the time-consuming modular inverse operations in the classical elliptic curve digital signature algorithm(ECDSA),an efficient and lightweight two-parameter elliptic curve digital signature(TP-ECDSA)batch verification scheme is proposed.On the one hand,TP-ECDSA has no modular inverse operations in either the signature or verification phase,and introducing batch verification in this algorithm can reduce the number of scalar product computations from 2t to[2,t+1].On the other hand,the KGLP algorithm can accelerate the scalar multiplication operation,and the introduction of this algorithm can significantly improve the efficiency of signature verification.Experi-ments show that compared with ECDSA,the operating speed of TP-ECDSA is improved by more than 50%for both independent and batch verification,and the efficiency of signature verification is signifi-cantly improved.

ECDSAbatch verificationmodular inverse operationscalar multiplication opera-tionKGLP algorithm

巫光福、傅晓艳、周建东

展开 >

江西理工大学信息工程学院,江西赣州 341000

椭圆曲线数字签名 批量验证 模逆运算 标量乘运算 KGLP算法

国家自然科学基金项目国家密码学重点实验室项目

11461031MMKFKT202123

2024

佳木斯大学学报(自然科学版)
佳木斯大学

佳木斯大学学报(自然科学版)

影响因子:0.159
ISSN:1008-1402
年,卷(期):2024.42(1)
  • 15