A modified scheme based on He-Keisler scheme using Integer factorization and Discrete Logarithms

The Digital Signatures are used to provide the security to messages. These Digital signatures use Integer factorization (FAC) or Discrete Logarithms (DLP) or both. Mainly we have analyzed certain class of Digital Signature Schemes. This class includes T. ElGamal, He-Kiesler, Shimin-Wei and Swati Varma´s Schemes. All these schemes are based on FAC and DLP. These schemes use quadratic residue for security purpose. He-Kiesler digital signature scheme which combines Integer Factorization and Discrete Logarithm together making it difficult for solving two hard problems. But there are some drawbacks in this scheme. An attack is possible on this signatures scheme. This paper demystifies the He-Kiesler algorithm and provide new modified scheme.