Abstract
Shao claims that an ElGamal variant is immune to homomorphism attack. The present work illustrates that contrary to this, the scheme is vulnerable to homomorphism attacks. The success of such an attack appears to be more likely than finding a discrete logarithm, as long as the random integer used to construct the signature is chosen at random.
Original language | British English |
---|---|
Pages (from-to) | 2329-2330 |
Number of pages | 2 |
Journal | Electronics Letters |
Volume | 34 |
Issue number | 24 |
DOIs | |
State | Published - 1 Jan 1998 |