Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 171-176 |
Number of pages | 6 |
Journal | Applied Mathematics and Computation |
Volume | 165 |
Issue number | 1 |
DOIs | |
State | Published - 06 06 2005 |
Keywords
- Computational complexity
- Digital signatures
- Modular exponentiation
- Signature verification