COMPLEXITY-MEASURES FOR PUBLIC-KEY CRYPTOSYSTEMS

被引：165

作者：

GROLLMANN, J ^{[1
]}

SELMAN, AL ^{[1
]}

机构：

[1] NORTHEASTERN UNIV,COLL COMP SCI,BOSTON,MA 02115

来源：

SIAM JOURNAL ON COMPUTING | 1988年 / 17卷 / 02期

关键词：

Complexity Measures - Complexity Theory - Cracking Problems - NP Completeness - Promise Problems - Public Key Cryptosystem;

D O I：

10.1137/0217018

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

(Edited Abstract)

引用

页码：309 / 335

页数：27

共 57 条

[1]

ADLEMAN LM, 1977, 9TH P ACN S THEOR CO, P151

[2]

Baker T., 1975, SIAM Journal on Computing, V4, P431, DOI 10.1137/0204037

[3] BI-IMMUNE SETS FOR COMPLEXITY CLASSES [J].

BALCAZAR, JL ;

SCHONING, U .

MATHEMATICAL SYSTEMS THEORY, 1985, 18 (01) :1-10

[4] RELATIVE TO A RANDOM ORACLE-A, PA NOT-EQUAL NPA NOT-EQUAL CO-NPA WITH PROBABILITY-1 [J].

BENNETT, CH ;

GILL, J .

SIAM JOURNAL ON COMPUTING, 1981, 10 (01) :96-113

[5]

BERMAN L, 1976, 17TH P IEEE S F COMP, P76

[6] HOW TO GENERATE CRYPTOGRAPHICALLY STRONG SEQUENCES OF PSEUDO-RANDOM BITS [J].

BLUM, M ;

MICALI, S .

SIAM JOURNAL ON COMPUTING, 1984, 13 (04) :850-864

[7]

BLUM M, 1985, P CRYPTO 84, P289

[8] QUALITATIVE RELATIVIZATIONS OF COMPLEXITY CLASSES [J].

BOOK, RV ;

LONG, TJ ;

SELMAN, AL .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (03) :395-413

[9]

BOOK RV, 1984, SIAM J COMPUT, V13, P461, DOI 10.1137/0213030

[10]

BOPPANA R, 1986, LECTURE NOTES COMPUT, P51

← 1 2 3 4 5 6 →