Design of practical and provably good random number generators

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 1-9

  Aiello, William ^a   Rajagopalan, Sivaramakrishnan ^b   Venkatesan, Ramarathnam ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; NUMBER THEORY;

HIGH QUALITY; PRE-PROCESSING STEP; PSEUDORANDOM GENERATORS; RANDOM NUMBER GENERATORS; RANDOM SOURCES; RANDOMIZED ALGORITHMS;

RANDOM NUMBER GENERATION;

EID: 84969401421     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Aiello, W., R. Venkatesan, "High Quality Pseudorandom Generators: Fast Serial and Parallel Implementations", Bellcore Technical Memorandum, 1993.
2. Ajtai, M., Komlos, J., Szemeredi, E., "Deterministic Simulation of Logspace, " Proc. of ACM Symp. on Theory of Computing (1987).
3. Alexi, W., B. Chor, O. Goldreich, C. P. Schnorr, "RSA and Rabin Functions: Certain parts are as hard as the whole, " SIAM J. Computing, 17 (1988) 194-209.
4. Biham, E., A. Shamir, "Differential Analysis of DES-like Crypto System, " Advances in Cryptology, CRYPTO '90.
5. Blum, M., S. Micali, "How to Generate Cryptograph-ically Strong Sequences of Pseudorandom Bits, " Proc. of IEEE Symp. on Foundations of Computer Science (1982);
6. SIAM J. CompuL, 13 (1984) 850-864.
7. Bach, E., "Realistic Analysis of Some Randomized Algorithms, " J. Computer Sys. Sci. 42 (1991) 30-53.
8. Bellare, M., Goldreich, O., Goldwasser, S., "Randomness in Interactive Proofs, " Proc. of IEEE Symp. on Foundations of Computer Science (1990).
9. Feldmeier, D. C, P.R. Karn, "UNIX Password Security - Ten Years Later, " Advances in Cryptology, CRYPTO '89.
10. Ferrenberg, A. M., D. P. Landau, Y. J. Wong, "Monte-Carlo Simulations: Hidden errors from "Good" Random Number Generator", Physical Review Letters, vol 69 (23) Dec. 1992.
11. Frieze, A. M., J. Hastad, R. Kannan, J.C. Lagarias, "Reconstructing Truncated Integer Variables Satisfying Linear Congruences, " SIAM J. Comput. 17 (1988) 262280.
12. Gabber, O., Z. Galil, "Explicit constructions of linear-sized superconcentrators, " J. Comput. Sys. Sci. 22 (1981).
13. Goldreich O., S. Goldwasser, S. Micali, "How To Construct Random Functions, " Proc. of IEEE Symp. on Foundations of Computing (1986).
14. Goldreich O., S. Goldwasser, M. Bellare, "Randomness in Interactive Proof Systems, " Proc. of IEEE Symp. on Foundations of Computing (1990).
15. Goldreich, O., L. A. Levin, "Hard Core Bit For Any One Way Function, " Proc. of ACM Symp. on Theory of Computing (1990).
16. Goldreich, O., R. Impagliazzo, L. A. Levin, R. Venkate-san, D. Zuckerman, "Security Preserving Amplification of Hardness, " Proc. of IEEE Symp. on Foundations of Computer Science (1990).
17. Hastad, J., R. Impagliazzo, L. Levin, M. Luby, "Pseudorandom Generation From One-Way Functions, Proc. ACM Symp. on Theory of Computing (1989) 12-24;
18. "Pseudorandom Generators under Uniform assumptions, " Proc. of ACM Symp. on Theory of Computing (1990) 395-404.
19. Impagliazzo, R., M. Naor, "Efficient Cryptographic Schemes Provably as secure as Subset Sum, " Proc. of IEEE Symp. on Foundations of Computer Science (1989) 236-241.
20. Kannan, R., A. K. Lenstra, L. Lovasz, "Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers, " Math. Comp. 50 (1988) 235-250.
21. Karloff, A., P. Raghavan, "Randomized Algorithms and Pseudorandom Numbers, " Proc. of ACM Symp. on Theory of Computing, (1988), 310-321.
22. Knuth, D. E., The Art of Computer Programming, Volume 2, Addison-Wesley, 1973.
23. Lagarias, J., J. Reed, "Unique Extrapolation of Polynomial Recurrences, " SIAM J. Comput. 17 (1988) 342362.
24. Levin, L., C.Rackoff, R. Venkatesan.(based on [Alexi+ 88])
25. Luby, M., Cryptography, Draft Manuscript, 1993, Princeton Univ Press, to appear.
26. National Bureau of Standards, Data Encryption Standard, Department of Commerce, FIPS, pub 46, Jan., 1977.
27. Plumstead, J. B. "Inferring Sequences Produced By Pseudorandom Number Generators, " J. ACM 36 (1989), 129-141.
28. Vazirani, U, V. Vazirani, "Efficiency considerations in using semi-random sources", STOC 19 (1987) 160-168.
29. Yao, A. C, "Theory and Applications of Trapdoor Functions, " Proc. of IEEE Symp. on Foundations of Computer Science (1982) 80-91.
30. Zuckerman, D., "General weak random sources", FOCS31 (1990), 318-326.