SIAM J. Comput., 15, 2, 364--383. Preliminary version published in Proceedings of CRYPTO 82 , 61--78. Blum, M. and Micali, S. (1984). How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. on Computing , 13, 4, 850--864. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
About Polynomial-Time "unpredictable" Generators - L'Ecuyer, Proulx (Correct)
No context found.
SIAM J. Comput., 15, 2, 364--383. Preliminary version published in Proceedings of CRYPTO 82 , 61--78. Blum, M. and Micali, S. (1984). How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. on Computing , 13, 4, 850--864.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC