TIME MEMORY PROCESSOR TRADE-OFFS

被引：15

作者：

AMIRAZIZI, HR ^{[1
]}

HELLMAN, ME ^{[1
]}

机构：

[1] STANFORD UNIV,DEPT ELECT ENGN,STANFORD,CA 94305

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1988年 / 34卷 / 03期

关键词：

D O I：

10.1109/18.6030

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：505 / 512

页数：8

共 11 条

[1]

AMIRAZIZI HR, 1986, THESIS STANFORD U ST

[2]

BATCHER KE, 1968, 1968 P AFIPS SPRING, P307

[3] EXHAUSTIVE CRYPT-ANALYSIS OF NBS DATA ENCRYPTION STANDARD [J].

DIFFIE, W ;

HELLMAN, ME .

COMPUTER, 1977, 10 (06) :74-84

[4] NEW DIRECTIONS IN CRYPTOGRAPHY [J].

DIFFIE, W ;

HELLMAN, ME .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654

[5] A CRYPTANALYTIC TIME-MEMORY TRADE-OFF [J].

HELLMAN, ME .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (04) :401-406

[6]

KARNIN ED, 1984, IEEE T COMPUT, V33, P404, DOI 10.1109/TC.1984.1676456

[7]

MARCUS MJ, 1977, P IEEE, V65

[8] HIDING INFORMATION AND SIGNATURES IN TRAPDOOR KNAPSACKS [J].

MERKLE, RC ;

HELLMAN, ME .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (05) :525-530

[9] 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

[10] A T=O(2N-2), S=O(2N-4) ALGORITHM FOR CERTAIN NP-COMPLETE PROBLEMS [J].

SCHROEPPEL, R ;

SHAMIR, A .

SIAM JOURNAL ON COMPUTING, 1981, 10 (03) :456-464

← 1 2 →