Indivar Gupta

  • Citations Per Year
Learn More
D. Chaum and H. van Antwerpen first introduced the concept of an undeniable signature scheme where the verification step is verified with the signer’s co-operation. In this paper, first we discuss a combination of Discrete Logarithm Problem (DLP) and Conjugacy Search Problem (CSP) analysing its security. Then we propose an undeniable signature scheme in a(More)
Elliptic Curve Discrete Log Problem (ECDLP) is the underlying basis of many popular Public Key Scheme like Diffie-Hellman and ElGamal. The strength of such public key schemes is based on the difficulty of solving the ECDLP. The best method for solving the ECDLP has time complexity exponential in the size of the underlying field. ECDLP based cryptosystems(More)