A SUBEXPONENTIAL-TIME ALGORITHM FOR COMPUTING DISCRETE LOGARITHMS OVER GF(P2)

被引：24

作者：

ELGAMAL, T ^{[1
]}

机构：

[1] STANFORD UNIV,INFORMAT SYST LAB,STANFORD,CA 94305

来源：

关键词：

D O I：

10.1109/TIT.1985.1057075

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：473 / 481

页数：9

共 23 条

[1]

ADLEMAN L, 1979, 20TH P ANN FOCS C

[2] THE LEAST QUADRATIC NON RESIDUE [J].

ANKENY, NC .

[3]

BACH E, UNPUB WHAT DO WITNES

[4]

BERLEKAMP E, 1978, ALGEBRAIC CODING THE

[5] COMPUTING LOGARITHMS IN FINITE-FIELDS OF CHARACTERISTIC 2 [J].

BLAKE, IF ;

FUJIHARA, R ;

MULLIN, RC ;

VANSTONE, SA .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (02) :276-285

[6]

Cohn H., 1980, ADV NUMBER THEORY

[7] FAST EVALUATION OF LOGARITHMS IN FIELDS OF CHARACTERISTIC 2 [J].

COPPERSMITH, D .

[8] NEW DIRECTIONS IN CRYPTOGRAPHY [J].

DIFFIE, W ;

HELLMAN, ME .

[9]

DIXON J, 1981, MATH COMPUT, V36

[10]

ELGAMAL T, 1984, THESIS STANFORD U ST