Generating Quasi-Random Sequences From Slightly-Random Sources
作者： M. Santha , U.V. Vazirani
关键词: Discrete mathematics 、 Graphics 、 Stochastic process 、 Cryptography 、 Stochastic simulation 、 Markov process 、 Mathematics 、 Zener diode 、 Random number generation 、 Randomness
摘要: Several applications require truly random bit sequences, whereas physical sources of randomness are at best imperfect. We consider a general model for these slightly-random (e,g. zener diodes), and show how to convert their output into 'random looking ' which we call quasi -random. that quasi-random sequences indistinguishable from ones in strong sense. This enables us prove can be used place such as seeds pseudo-random number generators, randomizing algorithms, stochastic simulation experiments.
sci-hub.se 参考文章(10)
Manuel Blum, Coin Flipping by Telephone. international cryptology conference. pp. 11- 15 ,(1981)
Bruce W Schmeiser, Random Variate Generation: A Survey. Institute of Electrical and Electronics Engineers (IEEE). ,(1980)
Shafi Goldwasser, Silvio Micali, Probabilistic encryption & how to play mental poker keeping secret all partial information Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. pp. 365- 377 ,(1982) , 10.1145/800070.802212
H.F. Murry, A General Approach for Generating Natural Random Variables IEEE Transactions on Computers. ,vol. C-19, pp. 1210- 1213 ,(1970) , 10.1109/T-C.1970.222860
Andrew C Yao, None, Theory and application of trapdoor functions foundations of computer science. pp. 80- 91 ,(1982) , 10.1109/SFCS.1982.95
Manuel Blum, Coin flipping by telephone a protocol for solving impossible problems ACM SIGACT News. ,vol. 15, pp. 23- 27 ,(1983) , 10.1145/1008908.1008911
Adi Shamir, On the generation of cryptographically strong pseudorandom sequences ACM Transactions on Computer Systems. ,vol. 1, pp. 38- 44 ,(1983) , 10.1145/357353.357357
Adi Shamir, On the Generation of Cryptographically Strong Pseudo-Random Sequences international colloquium on automata, languages and programming. pp. 544- 550 ,(1981) , 10.1007/3-540-10843-2_43
Manuel Blum, Silvio Micali, How to generate cryptographically strong sequences of pseudo random bits 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). pp. 112- 117 ,(1982) , 10.1109/SFCS.1982.72
Andrew C. Yao, Theory and application of trapdoor functions 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). pp. 80- 91 ,(1982) , 10.1109/SFCS.1982.45