HOW TO CONSTRUCT PSEUDORANDOM PERMUTATIONS FROM PSEUDORANDOM FUNCTIONS

被引：496

作者：

LUBY, M

RACKOFF, C

机构：

来源：

关键词：

D O I：

10.1137/0217022

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：373 / 386

页数：14

共 13 条

[1] RSA AND RABIN FUNCTIONS - CERTAIN PARTS ARE AS HARD AS THE WHOLE [J].

ALEXI, W ;

CHOR, B ;

GOLDREICH, O ;

SCHNORR, CP .

[2]

Bamford James, 1983, PUZZLE PALACE REPORT

[3]

BENOR M, 1983, 15TH P ACM S THEOR C, P421

BLUM, M ;

MICALI, S .

[5]

DENNING DER, 1983, CRYPTOGRAPHY DATA SE

[6]

GOLDREICH O, 1984, 25TH P ANN S F COMP

[7]

Goldwasser S., 1982, 23rd Annual Symposium on Foundations of Computer Science, P134, DOI 10.1109/SFCS.1982.100

[8]

HODGES A, 1985, A TURING ENIGMA INTE

[9]

LEVIN LA, 1985, 17TH P ACM S THEOR C, P363

[10]

LUBY M, 1986, 18TH P ANN S THEOR C