Meta-He digital signatures based on factoring and discrete logarithms

作者:

Highlights:

摘要

This paper investigates all 8 variants of the He’s digital signature scheme based on factoring and discrete logarithms. Instead of using three modular exponentiation computation, the two most optimal schemes of the generalized He’s signature require only two modular exponentiation for signature verification.

论文关键词:Digital signatures,Signature verification,Computational complexity,Modular exponentiation

论文评审过程:Available online 27 August 2004.

论文官网地址:https://doi.org/10.1016/j.amc.2004.04.082