NOTE ON THE COMPLEXITY OF CRYPTOGRAPHY

被引：34

作者：

BRASSARD, G

机构：

[1] Department of Computer Science, Cornell University

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1979年 / 25卷 / 02期

关键词：

D O I：

10.1109/TIT.1979.1056010

中图分类号：

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

学科分类号：

0812 ;

摘要：

Evidence is given for the difficulty of an eventual proof of computational security for cryptosystems based on one-way functions, such as the one proposed by Diffie and Hellman. A proof of NP-completeness for the cryptanalytic effort would imply NP = CoNP. © 1979 IEEE

引用

页码：232 / 233

页数：2

共 9 条

[1]

ADLEMAN L, 1978, COMMUNICATION

[2]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[3]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[4] NEW DIRECTIONS IN CRYPTOGRAPHY [J].

DIFFIE, W ;

HELLMAN, ME .

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

[5]

Karp R. M., 1972, COMPLEXITY COMPUTER

[6]

Knuth D. E., 1969, ART COMPUTER PROGRAM, V2

[7] RIEMANNS HYPOTHESIS AND TESTS FOR PRIMALITY [J].

MILLER, GL .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) :300-317

[8]

Pratt V. R., 1975, SIAM Journal on Computing, V4, P214, DOI 10.1137/0204018

[9]

RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI 10.1145/357980.358017

← 1 →