C. H. Bennett, G. Brassard, and J. Robert, Privacy Amplification by Public Discussion, SIAM Journal on Computing, vol.17, issue.2, pp.210-229, 1988.
DOI : 10.1137/0217014

[. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.235-265, 1997.
DOI : 10.1006/jsco.1996.0125

J. Beirlant, E. J. Dudewicz, L. Györfi, and E. C. Meulen, Nonparametric entropy estimation: An overview, Int. J. Math. Stat. Sci, vol.6, pp.17-39, 1997.

[. Barak and S. Halevi, A model and architecture for pseudo-random generation with applications to /dev/random, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, pp.203-212, 2005.
DOI : 10.1145/1102120.1102148

E. Barker and J. Kelsey, Recommendation for random number generation using deterministic random bit generators (revised), 2007.

M. Bucci and R. Luzzi, Design of Testable Random Bit Generators, CHES 2005, pp.147-156, 2005.
DOI : 10.1007/11545262_11

J. Corbet, A. Rubini, and G. Kroah-hartman, Linux Device Drivers, 2005.

M. Thomas, J. Cover, and . Thomas, Elements of Information Theory, 2006.

L. Dorrendorf, Z. Gutterman, and B. Pinkas, Cryptanalysis of the random number generator of the Windows operating system, ACM Transactions on Information and System Security, vol.13, issue.1, 2009.
DOI : 10.1145/1609956.1609966

D. Eastlake, J. Schiller, and S. Crocker, Randomness requirements for security, RFC, vol.4086, 2005.
DOI : 10.17487/rfc4086

[. Ferguson and B. Schneier, Practical Cryptography, 2003.

O. Goldreich, H. Krawczyk, and M. Luby, On the Existence of Pseudorandom Generators, SIAM Journal on Computing, vol.22, issue.6, pp.1163-1175, 1993.
DOI : 10.1137/0222069

Z. Gutterman, B. Pinkas, and T. Reinman, Analysis of the Linux random number generator, 2006 IEEE Symposium on Security and Privacy (S&P'06), pp.371-385, 2006.
DOI : 10.1109/SP.2006.5

P. Grassberger, Estimating the information content of symbol sequences and efficient codes, IEEE Transactions on Information Theory, vol.35, issue.3, pp.669-675, 1989.
DOI : 10.1109/18.30993

P. Gutmann, Software generation of practically strong random numbers, USENIX Security Symposium -SSYM'98, pp.243-257, 1998.

J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, A Pseudorandom Generator from any One-way Function, SIAM Journal on Computing, vol.28, issue.4, pp.12-24, 1999.
DOI : 10.1137/S0097539793244708

[. Jun and P. Kocher, The Intel random number generator, 1999.

[. Kontoyiannis, P. H. Algoet, Y. M. Suhov, and A. J. Wyner, Nonparametric entropy estimation for stationary processes and random fields, with applications to English text, IEEE Transactions on Information Theory, vol.44, issue.3, pp.1319-1327, 1998.
DOI : 10.1109/18.669425

J. Kelsey, B. Schneier, and N. Ferguson, Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator, SAC'99, pp.13-33, 1999.
DOI : 10.1007/3-540-46513-8_2

J. Kelsey, B. Schneier, D. Wagner, and C. Hall, Cryptanalytic Attacks on Pseudorandom Number Generators, FSE'98, pp.168-188, 1998.
DOI : 10.1007/3-540-69710-1_12

R. Lidl and H. Niederreiter, Finite Fields, 1997.
DOI : 10.1017/CBO9780511525926

[. Matsumoto and Y. Kurita, Twisted GFSR generators, ACM Transactions on Modeling and Computer Simulation, vol.2, issue.3, pp.179-194, 1992.
DOI : 10.1145/146382.146383

A. J. Menezes, P. C. Van-oorschot, and S. A. Vanstone, Handbook of Applied Cryptography, 1996.
DOI : 10.1201/9781439821916

L. Paninski, Estimation of Entropy and Mutual Information, Neural Computation, vol.25, issue.6, pp.1191-1253, 2003.
DOI : 10.1103/PhysRevE.52.6841

W. Schindler, Efficient Online Tests for True Random Number Generators, CHES 2001, pp.103-117, 2001.
DOI : 10.1007/3-540-44709-1_10

R. Shaltiel, RECENT DEVELOPMENTS IN EXPLICIT CONSTRUCTIONS OF EXTRACTORS, Bulletin of the ACS, vol.77, pp.67-95, 2002.
DOI : 10.1142/9789812562494_0013

A. Seznec and N. Sendrier, HAVEGE, ACM Transactions on Modeling and Computer Simulation, vol.13, issue.4, pp.334-346, 2003.
DOI : 10.1145/945511.945516

J. S. Vitter, Design and analysis of dynamic Huffman codes, Journal of the ACM, vol.34, issue.4, pp.825-845, 1987.
DOI : 10.1145/31846.42227

N. Mark, J. Wegman, and . Carter, New hash functions and their use in authentification and set equality, J. of Comp. and Syst. Sciences, vol.22, pp.265-279, 1981.

X. Wang, Y. Lisa-yin, and H. Yu, Finding Collisions in the Full SHA-1, CRYPTO 2005, pp.17-36, 2005.
DOI : 10.1007/11535218_2