Bibliography

1

RSA Laboratories' Frequently Asked Questions About Today's Cryptography 4.1.
URL: http://www.rsasecurity.com/rsalabs/faq/.

2

M. Bellare, S. Goldwasser, and D. Micciancio.
``Pseudo-Random'' Number Generation within Cryptographic Algorithms: the DSS Case.
In Advances in Cryptology - Crypto 97 Proceedings, Lecture Notes in Computer Science No. 1294. Springer-Verlag, 1997.

3

L. Blum, M. Blum, and M. Shub.
A Simple Unpredictable Pseudo-Random Number Generator.
In SIAM Journal on Computing, volume 15, pages 364-383, May 1986.

4

A. Frieze, J. Hastad, R. Kannan, J. C. Lagarias, and A. Shamir.
Reconstructing Truncated Linear Variables Satisfying Linear Congruences.
In SIAM Journal on Computing, volume 17, pages 262-280, April 1988.

5

P. Hellekalek.
Inversive Pseudorandom Number Generators: Concepts, Results And Links.
In Proceedings of the 1995 Winter Simulation Conference, pages 255-262, 1995.

6

P. Hellekalek.
Good Random Number Generators Are (not so) Easy to Find.
In Mathematics and Computers in Simulation, volume 46, pages 485-505, 1998.

7

R. Jain.
The Art of Computer Systems Performance Analysis.
Wiley, 1991.

8

D. E. Knuth.
The Art of Computer Programming: Vol 2 / Seminumerical Algorithms.
Addison-Wesley, 2nd edition, 1981.

9

J. C. Lagarias.
Pseudorandom Numbers.
In Statistical Science, volume 8, pages 31-39, 1993.

10

A. M. Law and W. D. Kelton.
Simulation Modeling and Analysis.
McGraw-Hill, 3rd edition, 2000.

11

P. L'Ecuyer.
Maximally Equidistributed Combined Tausworthe Generators.
In Mathematics and Computation, volume 213, pages 203-213, 1996.

12

P. L'Ecuyer and R. Proulx.
About Polynomial-Time ``Unpredictable'' Generators.
In Proceedings of the 1989 Winter Simulation Conference, pages 467-476, 1989.

13

M. Li and P. Vitanyi.
An Introduction to Kolmogorov Complexity and Its Applications.
Springer-Verlag, 2nd edition, 1997.

14

G. Marsaglia.
A Current View of Random Number Generators.
In Computing Science and Statistics: Proceedings of the 16th Symposium on the Interface", pages 3-10. Elsevier Science Publishers B.V., Amsterdam, 1985.

15

M. Matsumoto and T. Nishimura.
Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator.
In ACM Transaction on Modeling and Computer Simulation, volume 8, pages 3-30, January 1998.

16

T. Ritter.
The Efficient Generation of Cryptographic Confusion Sequences.
In Cryptologia, volume 15, pages 81-139, 1991.

17

R.C. Tausworthe.
Random Numbers Generated by Linear Recurrence Modulo Two.
In Mathematics and Computation, volume 19, pages 201-209, 1965.