A SIMPLE UNPREDICTABLE PSEUDORANDOM NUMBER GENERATOR

被引：508

作者：

BLUM, L

BLUM, M

SHUB, M

机构：

[1] UNIV CALIF BERKELEY,DEPT MATH,BERKELEY,CA 94720

[2] UNIV CALIF BERKELEY,DEPT ELECT ENGN & COMP SCI,BERKELEY,CA 94720

[3] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

[4] CUNY,NEW YORK,NY 10036

来源：

关键词：

D O I：

10.1137/0215025

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：364 / 383

页数：20

共 29 条

[1]

Adleman L. M., 1980, 21st Annual Symposium on Foundations of Computer Science, P387, DOI 10.1109/SFCS.1980.28

[2]

BACH E, UNPUB GENERATE RANDO

[3]

Billingsley P., 1965, ERGODIC THEORY INFOR

[4]

Blum M., 1982, 23rd Annual Symposium on Foundations of Computer Science, P112, DOI 10.1109/SFCS.1982.72

[5]

BLUM M, 1982, SPR P IEEE COMPCOM, P133

[6]

Brassard G., 1983, Advances in Cryptology, Proceedings of Crypto 82, P79

[7]

Dickson L. E, 1919, HIST THEORY NUMBERS

[8] NEW DIRECTIONS IN CRYPTOGRAPHY [J].

DIFFIE, W ;

HELLMAN, ME .

[9]

Even S., 1979, GRAPH ALGORITHMS

[10]

Gauss C., 1801, DISQUISITIONES ARITH