Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Relationships among the computational powers of breaking discrete log cryptosystems
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
A novel electronic cash system with trustee-based anonymity revocation from pairing
Electronic Commerce Research and Applications
Electronic Commerce Research and Applications
Hi-index | 0.00 |
We provide a brief rebuttal of Chang (2012), who suggested that there were flaws in our article, Chen et al. (2011), that deserved further investigation and comment. We believe that these criticisms are unfounded, and offer some additional details related to the intractable discrete elliptic curve discrete logarithm problem to further support the case we wish to make.