A public key cryptosystem and a signature scheme based on discrete logarithms
暂无分享,去创建一个
[1] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[2] Martin E. Hellman,et al. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[3] Leonard M. Adleman,et al. A subexponential algorithm for the discrete logarithm problem with applications to cryptography , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[4] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[5] Claus-Peter Schnorr,et al. Signatures through Approximate Representation by Quadratic Forms , 1983, CRYPTO.
[6] Adi Shamir,et al. An efficient signature scheme based on quadratic equations , 1984, STOC '84.
[7] Don Coppersmith,et al. Fast evaluation of logarithms in fields of characteristic two , 1984, IEEE Trans. Inf. Theory.
[8] C. Schnorr,et al. A Monte Carlo factoring algorithm with linear storage , 1984 .
[9] Andrew M. Odlyzko,et al. Discrete Logarithms in Finite Fields and Their Cryptographic Significance , 1985, EUROCRYPT.
[10] T. Elgamal. A subexponential-time algorithm for computing discrete logarithms over GF(p^2) , 1985 .