A PUBLIC KEY CRYPTOSYSTEM AND A SIGNATURE SCHEME BASED ON DISCRETE LOGARITHMS

被引:4290
作者
ELGAMAL, T [1 ]
机构
[1] STANFORD UNIV,INFORMAT SYST LAB,STANFORD,CA 94305
关键词
D O I
10.1109/TIT.1985.1057074
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:469 / 472
页数:4
相关论文
共 10 条
[1]  
Adleman L., 1979, 20th Annual Symposium of Foundations of Computer Science, P55, DOI 10.1109/SFCS.1979.2
[2]  
[Anonymous], 1978, IEEE T INFORM THEORY
[3]   FAST EVALUATION OF LOGARITHMS IN FIELDS OF CHARACTERISTIC 2 [J].
COPPERSMITH, D .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (04) :587-594
[4]   A SUBEXPONENTIAL-TIME ALGORITHM FOR COMPUTING DISCRETE LOGARITHMS OVER GF(P2) [J].
ELGAMAL, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (04) :473-481
[5]  
ODLYZKO AM, UNPUB P EUROCRYPT 84
[6]  
ONG H, UNPUB SIGNATURES APP
[7]  
ONG H, 1984, 16TH P ACM S THEOR C, P208
[8]   IMPROVED ALGORITHM FOR COMPUTING LOGARITHMS OVER GF(P) AND ITS CRYPTOGRAPHIC SIGNIFICANCE [J].
POHLIG, SC ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (01) :106-110
[9]  
RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI [10.1145/359340.359342, 10.1145/357980.358017]
[10]  
SCHNORR CP, 1984, MATH COMPUT, V43, P289, DOI 10.1090/S0025-5718-1984-0744939-5