HOW TO GENERATE CRYPTOGRAPHICALLY STRONG SEQUENCES OF PSEUDO-RANDOM BITS

被引：627

作者：

BLUM, M ^{[1
]}

MICALI, S ^{[1
]}

机构：

[1] MIT, COMP SCI LAB, CAMBRIDGE, MA 02139 USA

来源：

关键词：

D O I：

10.1137/0213053

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：850 / 864

页数：15

共 35 条

[1] Adleman L., 1977, 18th Annual Symposium on Foundations of Computer Science, P175, DOI 10.1109/SFCS.1977.18
[2] Adleman L., 1979, 20th Annual Symposium of Foundations of Computer Science, P55, DOI 10.1109/SFCS.1979.2
[3] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047
[4] BACH E, 1983, 15TH P ACM S THEOR C
[5] BEKER H, 1982, CIPHER SYSTEMS
[6] BERMAN P, 1978, LECTURE NOTES COMPUT, V62, P63
[7] BLUM L, UNPUB SIAM J COMPUT
[8] BLUM L, P CRYPTO 82
[9] Blum M., 1982, 23rd Annual Symposium on Foundations of Computer Science, P112, DOI 10.1109/SFCS.1982.72
[10] BLUM M, 1981, UNPUB 3 APPLICATIONS