A Modified Wei-Hua-He Digital Signature Scheme Based on Factoring and Discrete Logarithm

Abstract

A symmetric cipher such as AES in cryptography is much faster than an asymmetric cipher but digital signatures often use asymmetric key ciphers because they provides the sender’s identity and data integrity. In this paper, a modified-He digital signature scheme is proposed using a one-way hash function. The proposed scheme, unlike the He signature technique, employs Euclid’s Division Lemma with large prime moduli p. Its security is built on large integer factoring, discrete logarithms and expanded root problems. The time complexity of the proposed scheme is O(log3p). The proposed modified-He scheme is efficient, as evidenced by the analytical results with key lengths greater than 512 bits.

Keywords

• cryptography
• digital signature
• discrete logarithm
• Euclid’s Division Lemma