Improvement of Harn digital signature scheme
Hou Zheng-feng · Journal of Hefei University of Technology · 2004
In the Harn digital signature scheme,the signatory need not compute any inverses and the person who verifies the key only need compute two modular exponents, so the computation work is less in comparison with other schemes based on discrete logarithm. But in using the Harn scheme,the homomorphism attack can not be resisted and the random key k can not be used reduplicatively. Aiming at this drawback, an improved scheme is introduced,in which not only the advantages of the Harn scheme are kept,but also the homomorphism attack is resisted effectively. In addition, the new scheme can ensure the scheme's security when the same random key k is used.