Recommendations
Zero-Knowledge Argument for Simultaneous Discrete Logarithms
In Crypto 1992, Chaum and Pedersen introduced a protocol (CP protocol for short) for proving the equality of two discrete logarithms (EQDL) with unconditional soundness, which is widely used nowadays and plays a central role in DL-based cryptography. ...
Remarks on some signature schemes based on factoring and discrete logarithms
Recently, He [Digital signature scheme based on factoring and discrete logarithms, Electronics Letters 37 (4) (2001) 220-222], Hwang et al. [Improved digital signature scheme based on factoring and discrete logarithms, Journal of Discrete Mathematical ...
Discrete Logarithms: The Past and the Future
Special issue on towards a quarter-century of public key cryptographyThe first practical public key cryptosystem to be published, the Diffie–Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. This intractability hypothesis is also the foundation for the presumed security ...
Comments